login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065690 a(1) = 0; for n > 1 is a(n) the square root of the smallest square > a(n-1)^2 with a(n-1)^2 forming its final digits. 9
0, 10, 90, 410, 12090, 4699590, 1762700012090, 60424089429999995300410, 163858711658690481272000000000001762700012090, 284443295612274221167414335130587074570377999999999999999999999939575910570000004699590 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

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

CROSSREFS

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

Sequence in context: A024132 A192898 A044261 * A202919 A202576 A201723

Adjacent sequences:  A065687 A065688 A065689 * A065691 A065692 A065693

KEYWORD

base,nonn

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Nov 17 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 13:49 EST 2012. Contains 205810 sequences.