|
Search: id:A065297
|
|
|
| A065297 |
|
a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are all (with multiplicity) properly contained in the digits of a(n+1)^2, with a(0)=1. |
|
+0
7
|
|
| 1, 4, 13, 36, 113, 487, 1036, 3214, 10456, 36786, 100963, 319656, 1001964, 3165969, 10001786, 31626854, 100013919, 316256807, 1000029656
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Provably infinite and at least O(10^(n/2)). - David W. Wilson (davidwwilson(AT)comcast.net)
|
|
EXAMPLE
|
13^2 = 169 and 36 is the next smallest number whose square (in this case 1296) properly contains the digits 1,6,9.
|
|
CROSSREFS
|
Cf. A050630, A050631, A048559, A050636, A065298, A014563, A066825.
Sequence in context: A000299 A102301 A031506 this_sequence A067635 A003727 A103082
Adjacent sequences: A065294 A065295 A065296 this_sequence A065298 A065299 A065300
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Floor van Lamoen (fvlamoen(AT)hotmail.com), Oct 29 2001
|
|
EXTENSIONS
|
More terms from Marc Paulhus (paulhus(AT)wanadoo.nl), Jan 29, 2002
More terms from David W. Wilson (davidwwilson(AT)comcast.net) and Marc Paulhus (paulhus(AT)wanadoo.nl), Feb 05 2002
|
|
|
Search completed in 0.002 seconds
|
