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.

A122381 Numbers n such that A014148[n] is a prime.

This page as a plain text file.
%I A122381 #4 Jul 15 2023 16:47:54
%S A122381 1,2,3,6,10,23,31,46,55,58,66,70,82,91,118,131,151,163,182,187,198,
%T A122381 199,203,222,275,279,334,346,351,358,402,411,462,470,515,582,591,619,
%U A122381 639,650,667,671,679,706,739,750,767,835,851,875,882,899,919,926,962,966
%N A122381 Numbers n such that A014148[n] is a prime.
%C A122381 Corresponding primes are listed in A122382[n] = A014148[ a(n) ] = {2,7,17,103,467,6577,17189,61627,109919,130531,198109,239579,399557,559313,...}.
%F A122381 A014148[n] = Sum[ Sum[ Prime[k], {k,1,m} ], {m,1,n} ]. A014148[ a(n) ] = A122382[n].
%e A122381 A014148[n] begins {2,7,17,34,62,103,161,238,338,467,627,824,1062,1343,...}.
%e A122381 a(1) = 1 because A014148[1] = 2 is prime.
%e A122381 a(2) = 2 because A014148[2] = 7 is prime.
%t A122381 p=0;s=0;f=0;Do[p=Prime[n];s=s+p;f=f+s;If[PrimeQ[f],Print[{n,f}]],{n,1,2000}]
%t A122381 Position[Nest[Accumulate,Prime[Range[1000]],2],_?PrimeQ]//Flatten (* _Harvey P. Dale_, Jul 15 2023 *)
%Y A122381 Cf. A014148, A122382.
%K A122381 nonn
%O A122381 1,2
%A A122381 _Alexander Adamchuk_, Aug 30 2006