OFFSET
1,1
REFERENCES
Proposed by G. L. Honaker, Jr.
LINKS
T. D. Noe, Table of n, a(n) for n = 1..1000
EXAMPLE
131 is the 32nd prime and sum of digits of both is 5.
MATHEMATICA
Select[Range[1000], Total[IntegerDigits[#]]==Total[IntegerDigits[ Prime[#]]]&] (* Harvey P. Dale, May 05 2011 *)
PROG
(Haskell)
a033549 n = a033549_list !! (n-1)
a033549_list = filter ((== 0) . a090431) [1..]
-- Reinhard Zumkeller, Mar 16 2014
(PARI) is(n, p=prime(n))=sumdigits(n)==sumdigits(p) \\ Charles R Greathouse IV, Feb 07 2017
(Python)
from sympy.ntheory.factor_ import digits
from sympy import prime
print([n for n in range(1, 1001) if sum(digits(n)[1:])==sum(digits(prime(n))[1:])]) # Indranil Ghosh, Jun 27 2017
CROSSREFS
KEYWORD
nonn,base,nice
AUTHOR
Calculated by Jud McCranie
STATUS
approved