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!)
A121322 Numbers m such that m^5 contains every digit at least once. 1
309, 418, 462, 474, 575, 635, 662, 699, 702, 713, 737, 746, 747, 748, 765, 771, 795, 838, 875, 876, 892, 897, 943, 945, 976, 1009, 1012, 1018, 1033, 1072, 1104, 1107, 1137, 1143, 1149, 1167, 1174, 1183, 1187, 1195, 1203, 1233, 1248, 1249, 1269, 1292 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
309^5 = 2817036000549 contains every digit at least once.
MATHEMATICA
Select[Range@1500, 1+Union@IntegerDigits@(#^5)==Range@10&] (* Hans Rudolf Widmer, Nov 02 2021 *)
PROG
(PARI) isok(m) = #Set(digits(m^5)) == 10; \\ Michel Marcus, Nov 02 2021
(Python)
def ok(n): return len(set(str(n**5))) == 10
print([m for m in range(1293) if ok(m)]) # Michael S. Branicky, Nov 02 2021
CROSSREFS
Cf. A054038 (with m^2), A119735 (with m^3).
Sequence in context: A031782 A060980 A061881 * A067730 A183627 A184544
KEYWORD
nonn,base
AUTHOR
Tanya Khovanova, Aug 25 2006
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 July 22 00:58 EDT 2024. Contains 374478 sequences. (Running on oeis4.)