login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A067975
a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are all (with multiplicity) contained in the digits of a(n+1)^2, with a(0)=2.
2
2, 7, 43, 136, 367, 1157, 1822, 3658, 5558, 6196, 9679, 10183, 11794, 17852, 20813, 28354, 32193, 42852, 53787, 55044, 55707, 55983, 57636, 58464, 61719, 70209, 95232, 96354, 96921, 96963, 101407, 114223, 114323, 133564, 162293, 170843
OFFSET
0,1
COMMENTS
a(n) for n>0 remains the same when a(0)=3. If "contained in" is replaced by "properly contained in" we get A065298.
EXAMPLE
1157^2 = 1338649 and 1822 is the next smallest number whose square (in this case 3319684) contains the digits 1,3,3,8,6,4,9.
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Marc Paulhus, Feb 05 2002
STATUS
approved