|
|
A075697
|
|
a(n) = sum-of-digits(A075696(n)).
|
|
3
|
|
|
7, 3, 4, 3, 7, 10, 3, 9, 11, 9, 9, 1, 5, 7, 8, 9, 6, 6, 7, 8, 6, 7, 8, 9, 9, 10, 9, 10, 11, 2, 9, 7, 5, 14, 15, 16, 17, 17, 18, 18, 19, 6, 8, 13, 7, 9, 7, 9, 11, 17, 19, 4, 7, 9, 7, 8, 9, 16, 5, 6, 7, 9, 8, 9, 15, 8, 9, 19, 7, 8, 9, 8, 9, 17, 11, 17, 9, 10, 12, 15, 17, 18, 19, 13, 1, 2, 3, 7, 9
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
PROG
|
(Python)
from sympy import prime, primerange
def auptopn(lim):
alst = []
for k, pk in enumerate(primerange(2, prime(lim)+1), start=1):
sdk = sum(map(int, str(k)))
if str(sdk) in str(pk): alst.append(sdk)
return alst
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|