cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A121322 Numbers m such that m^5 contains every digit at least once.

Original entry on oeis.org

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
Offset: 1

Views

Author

Tanya Khovanova, Aug 25 2006

Keywords

Examples

			309^5 = 2817036000549 contains every digit at least once.
		

Crossrefs

Cf. A054038 (with m^2), A119735 (with m^3).

Programs

  • Mathematica
    Select[Range@1500, 1+Union@IntegerDigits@(#^5)==Range@10&] (* Hans Rudolf Widmer, Nov 02 2021 *)
  • 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