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
1, 16, 169, 1296, 12769, 237169, 1073296, 10329796, 109327936, 1353209796, 10193527369, 102179958336, 1003931857296, 10023359708961, 100035723189796, 1000257893937316, 10002783993738561, 100018367973835249 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = A065297(n)^2.
CROSSREFS
Cf. A065297.
Sequence in context: A067713 A017210 A283574 * A068175 A238976 A242078
KEYWORD
base,nonn
AUTHOR
Marc Paulhus, Feb 05 2002
STATUS
approved

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 15 17:19 EDT 2024. Contains 371693 sequences. (Running on oeis4.)