cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A104247 Primes that are the sum of digits of the first k primes for some k.

This page as a plain text file.
%I A104247 #17 Feb 24 2024 01:10:29
%S A104247 2,5,17,19,23,31,41,61,71,83,181,269,389,419,449,631,683,727,743,809,
%T A104247 929,1039,1061,1069,1091,1277,1381,1481,1567,1613,1747,1873,1951,1993,
%U A104247 2039,2129,2281,2297,2339,2381,2549,2579
%N A104247 Primes that are the sum of digits of the first k primes for some k.
%H A104247 M. F. Hasler, <a href="/A104247/b104247.txt">Table of n, a(n) for n = 1..1000</a>
%F A104247 a(n) = A007605(1) + ... + A007605(A058049(n)).
%e A104247 a(4)=19 because A058049(4)= 5 and sum of digits of the first 5 primes, 2+3+5+7+(1+1)=19 is prime.
%o A104247 (Python)
%o A104247 from sympy import isprime, nextprime
%o A104247 def sd(n): return sum(map(int, str(n)))
%o A104247 def aupto(limit):
%o A104247     alst, k, p, s = [], 1, 2, 2
%o A104247     while s <= limit:
%o A104247         if isprime(s): alst.append(s)
%o A104247         k += 1; p = nextprime(p); s += sd(p)
%o A104247     return alst
%o A104247 print(aupto(2579)) # _Michael S. Branicky_, Jul 18 2021
%Y A104247 Corresponding n's: A058049. Primes: A000040, sum of digits of primes: A007605.
%Y A104247 Cf. A051351, A075544.
%K A104247 nonn,base
%O A104247 1,1
%A A104247 _Zak Seidov_, Feb 26 2005