login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065690 a(1) = 0; for n > 1, a(n) is the square root of the smallest square > a(n-1)^2 with a(n-1)^2 forming its final digits. 9

%I #5 Sep 17 2023 21:34:32

%S 0,10,90,410,12090,4699590,1762700012090,60424089429999995300410,

%T 163858711658690481272000000000001762700012090,

%U 284443295612274221167414335130587074570377999999999999999999999939575910570000004699590

%N a(1) = 0; for n > 1, a(n) is the square root of the smallest square > a(n-1)^2 with a(n-1)^2 forming its final digits.

%C a(n) = 10*A050635(n-1) for n > 1; a(n) = sqrt(A065689(n)).

%Y Cf. A050634, A050635, A061359, A065689, A065691.

%K base,nonn

%O 1,2

%A _Klaus Brockhaus_, Nov 17 2001

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 18:58 EDT 2024. Contains 371781 sequences. (Running on oeis4.)