|
%I #14 Jul 03 2021 10:57:06
%S 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,
%T 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,
%U 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
%N a(n) = sum-of-digits(A075696(n)).
%H Michael S. Branicky, <a href="/A075697/b075697.txt">Table of n, a(n) for n = 1..10000</a>
%o (Python)
%o from sympy import prime, primerange
%o def auptopn(lim):
%o alst = []
%o for k, pk in enumerate(primerange(2, prime(lim)+1), start=1):
%o sdk = sum(map(int, str(k)))
%o if str(sdk) in str(pk): alst.append(sdk)
%o return alst
%o print(auptopn(1010)) # _Michael S. Branicky_, Jul 03 2021
%Y Cf. A007953, A075696, A075698.
%K easy,nonn,base
%O 1,1
%A _Zak Seidov_, Sep 26 2002
%E Corrected and extended by _Sascha Kurz_, Jan 30 2003
|
