A075697 a(n) = sum-of-digits(A075696(n)).

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

Offset

1,1

Links

Michael S. Branicky, Table of n, a(n) for n = 1..10000

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
print(auptopn(1010)) # Michael S. Branicky, Jul 03 2021

Crossrefs

Cf. A007953, A075696, A075698.

Sequence in context: A117043 A013664 A154173 * A222231 A011252 A165331

Adjacent sequences: A075694 A075695 A075696 * A075698 A075699 A075700

Keyword

easy,nonn,base

Author

Zak Seidov, Sep 26 2002

Extensions

Corrected and extended by Sascha Kurz, Jan 30 2003

Status

approved