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.

A111327 Numbers k such that 13 divides prime(1) + ... + prime(k).

This page as a plain text file.
%I A111327 #8 May 14 2024 03:58:36
%S A111327 49,61,67,87,92,117,119,126,131,160,166,179,203,253,269,295,297,299,
%T A111327 319,344,348,360,381,393,408,418,429,437,442,451,485,496,502,506,508,
%U A111327 510,532,541,553,559,565,585,591,623,626,647,652,656,662,672,692,712,715,733,736
%N A111327 Numbers k such that 13 divides prime(1) + ... + prime(k).
%H A111327 Amiram Eldar, <a href="/A111327/b111327.txt">Table of n, a(n) for n = 1..10000</a>
%t A111327 Position[Accumulate[Prime[Range[400]]], _?(Divisible[#, 13] &)] // Flatten (* _Amiram Eldar_, May 14 2024 *)
%o A111327 (PARI) lista(pmax) = {my(s = 0, k = 0); forprime(p = 2, pmax, k++; s += p; if(!(s % 13), print1(k, ", ")));} \\ _Amiram Eldar_, May 14 2024
%Y A111327 Cf. A007504, A103208, A111318, A111319, A111320, A111321, A111322, A111323, A111324, A111325, A111326.
%K A111327 nonn
%O A111327 1,1
%A A111327 _N. J. A. Sloane_, Nov 05 2005