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.
%I A272552 #16 Dec 07 2019 12:18:28 %S A272552 11376,14562,15057,15723,16659,20421,21330,24867,28494,28746 %N A272552 Numbers n such that n*prime(n) is a pandigital number containing digits 0-9 exactly once. %e A272552 11376 appears in the list because 11376 * prime(11376) = 1375028496 that contains digits 0-9 only once. %e A272552 15057 appears in the list because 15057 * prime(15057) = 2476108593 that contains digits 0-9 only once. %t A272552 Select[Range[100000], Sort@IntegerDigits[# Prime@#] == Range[0, 9] &] %o A272552 (PARI) isok(n) = my(d = digits(n*prime(n))); (#d == 10) && (#vecsort(d,,8) == 10); \\ _Michel Marcus_, May 02 2016 %o A272552 (Python) %o A272552 from sympy import prime %o A272552 from numpy import sort %o A272552 for n in range(10000,30000): %o A272552 num=sort(list(str(n*prime(n)))) %o A272552 res=''.join(num) %o A272552 if(res=='0123456789'):print(n) %o A272552 # _Soumil Mandal_, May 04 2016 %Y A272552 Cf. A050278, A171102, A210013. %K A272552 nonn,base,fini,full %O A272552 1,1 %A A272552 _K. D. Bajpai_, May 02 2016