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.

A160040 Numbers n such that pi(n) = prime(d_1)*prime(d_2)* ... *prime(d_k), where d_1, d_2, ... d_k is the decimal expansion of n, and the zeroth prime is 1.

Original entry on oeis.org

123, 2407, 5224, 8350, 11166, 30843, 51174, 66026, 172451, 202774, 266109, 546322, 1082682, 1830188, 1882036, 2754207, 3351809, 14355351, 23539612, 23539621, 24322837, 63950931, 122924349, 161485470, 204868903, 204868930, 252704792
Offset: 1

Views

Author

Robert G. Wilson v, Apr 30 2009

Keywords

Comments

See the references in A008578 for a discussion concerning the zeroth prime.

Crossrefs

Cf. A008578, A113581. A098683 is a proper subset.

Programs

  • Mathematica
    c = 0; k = 1; lst = {}; fQ[n_] := ( c == Times @@ (IntegerDigits@ n /. {0 -> 1, 1 -> 2, 2 -> 3, 3 -> 5, 4 -> 7, 5 -> 11, 6 -> 13, 7 -> 17, 8 -> 19, 9 -> 23}) ); While[k < 6000000000, If[PrimeQ@k, c++, If[ fQ@k, AppendTo[lst, k]; Print@k]]; k++ ]; lst