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!)
A067713 a(n+1) is the smallest square > a(n) such that the digits of a(n) are all (with multiplicity) contained in the digits of a(n+1), with a(0)=1. 0
1, 16, 169, 196, 961, 1296, 2916, 9216, 12769, 96721, 237169, 729316, 1073296, 1630729, 2709316, 10329796, 69739201, 109327936, 130279396, 133079296, 133702969, 309971236, 317302969, 917302369, 1353209796, 1725903936 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = A014563(n)^2.
CROSSREFS
Cf. A014563.
Sequence in context: A025445 A022740 A205247 * A017210 A283574 A067711
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 February 24 22:04 EST 2024. Contains 370307 sequences. (Running on oeis4.)