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!)
A061449 a(1) = 1; a(n+1) = smallest square > a(n) with leading digit equal to final digit of a(n) and final digit not 0. 0

%I #5 Dec 05 2013 19:54:50

%S 1,16,64,441,1024,4096,6084,40401,100489,900601,1002001,1004004,

%T 4004001,10004569,90003169,90022144,400040001,1000014129,9000127161,

%U 10000200001,10000400004,40000400001,100000147984,400000591936

%N a(1) = 1; a(n+1) = smallest square > a(n) with leading digit equal to final digit of a(n) and final digit not 0.

%H <a href="/index/Fi#final">Index entries for sequences related to final digits of numbers</a>

%K nonn,base,easy

%O 1,2

%A _Amarnath Murthy_, May 03 2001

%E Corrected and extended by Larry Reeves (larryr(AT)acm.org), May 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 19 17:51 EDT 2024. Contains 371797 sequences. (Running on oeis4.)