The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #6 Dec 05 2013 19:56:18
%S 81,2401,62001,1560001,351600001,47852000001,610350000001,
%T 586547900000001,5508423000000001,2032852170000000001,
%U 184259414700000000001,26756525040000000000001,26756525040000000000001
%N Smallest square k^2 == 1 (mod 10^n) where k > 1.
%C Sequence is infinite as (10^n + 1)^2 is a candidate, i.e. a(n) < = (10^n +1)^2.
%F a(n) = A181539(n)^2.
%Y Cf. A085878.
%K nonn
%O 1,1
%A _Amarnath Murthy_, Jul 07 2003
%E Corrected and extended by _Ray Chandler_, Jul 09 2003