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.

A272552 Numbers n such that n*prime(n) is a pandigital number containing digits 0-9 exactly once.

Original entry on oeis.org

11376, 14562, 15057, 15723, 16659, 20421, 21330, 24867, 28494, 28746
Offset: 1

Views

Author

K. D. Bajpai, May 02 2016

Keywords

Examples

			11376 appears in the list because 11376 * prime(11376) = 1375028496 that contains digits 0-9 only once.
15057 appears in the list because 15057 * prime(15057) = 2476108593 that contains digits 0-9 only once.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[100000], Sort@IntegerDigits[# Prime@#] == Range[0, 9] &]
  • PARI
    isok(n) = my(d = digits(n*prime(n))); (#d == 10) && (#vecsort(d,,8) == 10); \\ Michel Marcus, May 02 2016
    
  • Python
    from sympy import prime
    from numpy import sort
    for n in range(10000,30000):
       num=sort(list(str(n*prime(n))))
       res=''.join(num)
       if(res=='0123456789'):print(n)
    # Soumil Mandal, May 04 2016