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!)
A067711 a(n+1) is the smallest square > a(n) such that the digits of a(n) are all (with multiplicity) properly contained in the digits of a(n+1), with a(0)=1. 0

%I #6 Jan 03 2024 15:15:45

%S 1,16,169,1296,12769,237169,1073296,10329796,109327936,1353209796,

%T 10193527369,102179958336,1003931857296,10023359708961,

%U 100035723189796,1000257893937316,10002783993738561,100018367973835249

%N a(n+1) is the smallest square > a(n) such that the digits of a(n) are all (with multiplicity) properly contained in the digits of a(n+1), with a(0)=1.

%F a(n) = A065297(n)^2.

%Y Cf. A065297.

%K base,nonn

%O 0,2

%A _Marc Paulhus_, Feb 05 2002

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 September 9 07:24 EDT 2024. Contains 375762 sequences. (Running on oeis4.)