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.

Showing 1-2 of 2 results.

A109176 Five-digit primes which use each of the decimal digits 0 through 4 exactly once.

Original entry on oeis.org

10243, 12043, 20143, 20341, 20431, 23041, 24103, 30241, 32401, 40123, 40213, 40231, 41023, 41203, 42013, 43201
Offset: 1

Views

Author

Zak Seidov, Jun 21 2005

Keywords

Comments

There are exactly 16 five-digit primes using the decimal digits 0 through 4 exactly once. There are exactly 2668 eight-digit primes using the digits 0 through 7 exactly once: A109177 (smallest ones), A109178 (largest ones).
This is a subsequence of A187796 = A109176 union A109177, which comprises all primes of that form (in decimal notation). - M. F. Hasler, Jan 06 2013

Crossrefs

Programs

  • Mathematica
    Select[FromDigits/@Permutations[{0,1,2,3,4}],#>10^4&&PrimeQ[#]&] (* James C. McMahon, Mar 06 2024 *)

A199168 Numbers whose digits are a permutation of (0,...,m) for some m.

Original entry on oeis.org

0, 10, 102, 120, 201, 210, 1023, 1032, 1203, 1230, 1302, 1320, 2013, 2031, 2103, 2130, 2301, 2310, 3012, 3021, 3102, 3120, 3201, 3210, 10234, 10243, 10324, 10342, 10423, 10432, 12034, 12043, 12304, 12340, 12403, 12430, 13024, 13042, 13204, 13240, 13402, 13420
Offset: 1

Views

Author

M. F. Hasler, Jan 08 2013

Keywords

Comments

2013 is the fourth odd term in this sequence: Up to and including the 5 digit terms, odd terms must end in 1 or 3.
Due to the fact that 0 is not allowed as initial digit, this sequence is quite different from A030299, the analog with digits (1,...,m) instead of (0,...,m).

Crossrefs

Cf. A187796 (subset of primes), A203569 (also a subset), A030299 (permutations of 1..m) and references therein.
Pandigital numbers A050278 are also a subset.
Cf. A297062.

Programs

  • Maple
    f:= proc(n) map(L -> add(L[i]*10^(n-i),i=1..n), select(L -> L[1] <> 0, combinat:-permute([$0..n-1]))) end proc:
    f(1):= [0]:
    seq(op(f(n)),n=1..5); # Robert Israel, Jan 09 2025
  • PARI
    n_digit_terms(n)={my(a=[],p=vector(n,i,10^(n-i))~);for(i=(n-1)!,n!-(n>1),a=concat(a,numtoperm(n,i)%n*p));vecsort(a)} \\ - M. F. Hasler, Jan 08 2013
Showing 1-2 of 2 results.