OFFSET
1,1
COMMENTS
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
G. Harman, Counting Primes whose Sum of Digits is Prime, J. Integer Seq., 15 (2012), Article 12.2.2.
EXAMPLE
a(86) = 10037 because both the sum (=11) and number (=5) of digits are primes.
MATHEMATICA
Select[Prime[Range[200]], PrimeQ[Length[IntegerDigits[ # ]]]&&PrimeQ[Plus@@IntegerDigits[ # ]]&]
PROG
(Haskell)
a109981 n = a109981_list !! (n-1)
a109981_list = filter ((== 1) . a010051' . a055642) a046704_list
-- Reinhard Zumkeller, Nov 16 2012
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Zak Seidov, Jul 06 2005
STATUS
approved