|
Search: id:A054038
|
|
|
| A054038 |
|
Numbers n such that n^2 contains every digit at least once. |
|
+0
20
|
|
| 32043, 32286, 33144, 35172, 35337, 35757, 35853, 37176, 37905, 38772, 39147, 39336, 40545, 42744, 43902, 44016, 45567, 45624, 46587, 48852, 49314, 49353, 50706, 53976, 54918, 55446, 55524, 55581, 55626, 56532, 57321, 58413, 58455
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
There are 87 terms < 10^5; these are the n such that n^2 uses each digit exactly once. - David Wasserman (dwasserm(AT)earthlink.net), Feb 03 2005
|
|
REFERENCES
|
J.-M. De Koninck and A. Mercier, 1001 Problemes en Theorie Classique Des Nombres, Problem 239 pp. 39; 178, Ellipses Paris 2004.
|
|
MAPLE
|
f := []; for i from 0 to 200 do if nops({op(convert(i^2, base, 10))})=10 then f := [op(f), i] fi; od; f;
|
|
CROSSREFS
|
Cf. A016069, A054031, A054032, A054033, A054034, A054035, A054036, A054037, A054039.
Adjacent sequences: A054035 A054036 A054037 this_sequence A054039 A054040 A054041
Sequence in context: A154471 A140939 A134124 this_sequence A156977 A097282 A146896
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Asher Auel (asher.auel(AT)reed.edu) Feb 28 2000
|
|
EXTENSIONS
|
More terms from David Wasserman (dwasserm(AT)earthlink.net), Feb 03 2005
|
|
|
Search completed in 0.002 seconds
|
