%I A061490
%S A061490 1,2,3,19,166,8269
%N A061490 Smallest number which when iterated n times under A003285(n) gives a 
               square.
%C A061490 Smallest m such that A003285(A003285(..(m))) = square with n iterations.
%e A061490 A003285(A003285(3)))=1, 3 is the smallest number requiring 2 iterations 
               to reach a square number, so a(2)=3.
%Y A061490 Cf. A003285
%Y A061490 Sequence in context: A072877 A032329 A066227 this_sequence A048827 A032077 
               A014547
%Y A061490 Adjacent sequences: A061487 A061488 A061489 this_sequence A061491 A061492 
               A061493
%K A061490 more,nonn
%O A061490 0,2
%A A061490 Naohiro Nomoto (n_nomoto(AT)yabumi.com), Nov 08 2001