|
Search: id:A065298
|
|
|
| A065298 |
|
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)=2. |
|
+0
6
|
|
| 2, 7, 43, 136, 367, 1157, 3658, 10183, 32193, 101407, 320537, 1001842, 3166463, 10001923, 31627114, 100017313, 316599084, 1000104687
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
a(n) for n>0 remains the same when a(0)=3.
|
|
EXAMPLE
|
43^2 = 1849, and 136 is the next smallest number whose square (in this case 18496) properly contains the digits 1,4,8,9.
|
|
CROSSREFS
|
Cf. A050630, A050631, A048559, A050636, A065297.
Sequence in context: A108042 A001174 A067975 this_sequence A091877 A050631 A078676
Adjacent sequences: A065295 A065296 A065297 this_sequence A065299 A065300 A065301
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Floor van Lamoen (fvlamoen(AT)hotmail.com), Oct 29 2001
|
|
EXTENSIONS
|
More terms from Marc Paulhus (paulhus(AT)wanadoo.nl), Feb 04 2002
|
|
|
Search completed in 0.002 seconds
|
