Levenshtein distance & OEIS (Robbers) This is the Robber post. The Cop post is here.



Your task is to take an integer input N and output the Nth digit in the sequence OEIS A002942.

The sequence consists of the square numbers written backwards:

1, 4, 9, 61, 52, 63, 94, 46, 18, 1, 121, 441, ...


Note that leading zeros are trimmed away (100 becomes 1, not 001). Concatenating this into a string (or one long number gives):

1496152639446181121441


You shall output the Nth digit in this string/number. You may choose to take N as 0-indexed or 1-indexed (please state which one you choose).

Test cases (1-indexed):

N = 5,      ==&gt; 1
N = 17,     ==&gt; 1   &lt;- Important test case! It's not zero.
N = 20,     ==&gt; 4
N = 78,     ==&gt; 0
N = 100,    ==&gt; 4
N = 274164, ==&gt; 1


Your code should work for numbers up to N = 2^15 (unless your language can't handles 32 bit integers by default, in which case N can be lower). 



Robbers:

You should try to crack the Cops' posts. 

Your code must be in the same language as the Cop post, and have a Levenshtein distance exactly equal to the distance given by the cop. Your code cannot be longer than the original solution (but it can be the same size).

You may check the Levenshtein distance here!

The winner will be the robber that cracked the most posts.
Haskell, Laikoni



((show.(*1).read.reverse.show.(^2)=&lt;&lt;[1..])!!)


Try it online!

The (*1) was necessary  for type checking.