login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061490 Smallest number which when iterated n times under A003285(n) gives a square. 1

%I

%S 1,2,3,19,166,8269

%N Smallest number which when iterated n times under A003285(n) gives a square.

%C Smallest m such that A003285(A003285(..(m))) = square with n iterations.

%e A003285(A003285(3)))=1, 3 is the smallest number requiring 2 iterations to reach a square number, so a(2)=3.

%Y Cf. A003285

%K more,nonn

%O 0,2

%A _Naohiro Nomoto_, Nov 08 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 24 09:29 EDT 2021. Contains 348220 sequences. (Running on oeis4.)