|
%I #13 Sep 03 2024 08:25:11
%S 1,47,318,10546,10552,10629,86544,56196114,56200915,56676030,
%T 4555804158,4559732893,77220966866,2907021742443997,2907021767925176,
%U 2907024290266584,2932496986613869,51280189662853652,2461813897281353935,23422580231698333926,23422580438055032295
%N Indices of primes with digit product = 2.
%C Next term is A000720(111111111111112111) > A000720(10^17) > 2*10^15.
%H Kim Walisch, <a href="https://github.com/kimwalisch/primecount">Fast C++ prime counting function implementation (primecount)</a>.
%F a(n) = A000720(A107612(n)). - _David Wasserman_, May 07 2008
%t Do[If[Apply[Times, IntegerDigits[Prime[n]]]==2, Print[n]], {n, 100000}]
%Y Corresponding primes in A107612.
%Y Cf. A000720, A053666, A101987, A107612.
%K nonn,base,changed
%O 1,2
%A _Zak Seidov_, May 17 2005
%E More terms from _Ryan Propper_, Jan 03 2008
%E a(14)-a(21) calculated using Kim Walisch's primecount and added by _Amiram Eldar_, Sep 03 2024
|
