Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A065689
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A065689 a(1) = 0; for n > 1 is a(n) the smallest square > a(n-1) with a(n-1) forming its final digits. +0
10
0, 100, 8100, 168100, 146168100, 22086146168100, 3107111332622086146168100, 3651070583444637156963107111332622086146168100, 26849677386445867852272270902339560405490043651070583444637156963107111332622086\ 146168100 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) = 100*A050634(n-1) for n > 1.

CROSSREFS

Cf. A050634, A050635, A061359, A065690, A065691.

Sequence in context: A017763 A053109 A151647 this_sequence A117687 A108741 A029798

Adjacent sequences: A065686 A065687 A065688 this_sequence A065690 A065691 A065692

KEYWORD

base,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research