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!)
A272552 Numbers n such that n*prime(n) is a pandigital number containing digits 0-9 exactly once. 0
11376, 14562, 15057, 15723, 16659, 20421, 21330, 24867, 28494, 28746 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
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.
MATHEMATICA
Select[Range[100000], Sort@IntegerDigits[# Prime@#] == Range[0, 9] &]
PROG
(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
CROSSREFS
Sequence in context: A210122 A364717 A251957 * A237796 A236983 A268841
KEYWORD
nonn,base,fini,full
AUTHOR
K. D. Bajpai, May 02 2016
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 April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)