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.

This page as a plain text file.
%I A160040 #13 Mar 06 2019 19:58:43
%S A160040 123,2407,5224,8350,11166,30843,51174,66026,172451,202774,266109,
%T A160040 546322,1082682,1830188,1882036,2754207,3351809,14355351,23539612,
%U A160040 23539621,24322837,63950931,122924349,161485470,204868903,204868930,252704792
%N 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.
%C A160040 See the references in A008578 for a discussion concerning the zeroth prime.
%H A160040 Chai Wah Wu, <a href="/A160040/b160040.txt">Table of n, a(n) for n = 1..66</a> (n = 1..31 from Robert G. Wilson v)
%t A160040 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
%Y A160040 Cf. A008578, A113581. A098683 is a proper subset.
%K A160040 nonn,base
%O A160040 1,1
%A A160040 _Robert G. Wilson v_, Apr 30 2009