A364695 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A364695

Positive integers k such that the sum of the first k primes is a polygonal number of order greater than 2 (A090466).

3, 5, 7, 9, 10, 11, 13, 15, 16, 18, 19, 20, 21, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 34, 35, 36, 37, 39, 40, 42, 44, 46, 47, 49, 51, 52, 53, 54, 56, 57, 62, 68, 70, 72, 74, 75, 76, 77, 78, 79, 80, 82, 83, 84, 85, 86, 87, 88, 90, 91, 92, 97, 99, 103, 105, 106

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

Paolo Xausa, Table of n, a(n) for n = 1..10000

Wikipedia, Polygonal number.

Index to sequences related to polygonal numbers

EXAMPLE

5 is a term because the sum of the first 5 primes (2 + 3 + 5 + 7 = 28) is a triangular number.

7 is a term because the sum of the first 7 primes (2 + 3 + 5 + 7 + 11 + 13 = 58) is an octagonal number.

MATHEMATICA

A364693Q[n_]:=With[{d=Divisors[2n]}, Catch[For[i=3, i<Length[d]-1, i++, If[Divisible[2n/d[[i]]-2, d[[i]]-1], Throw[True]]]; False]]; (* After Jianing Song in A090466 *)

A364695list[kmax_]:=Flatten[Position[Map[A364693Q, Accumulate[Prime[Range[kmax]]]], True]]; A364695list[100]

PROG

(PARI) isok(k) = my(s = sum(i=1, k, prime(i))); for (j=3, s-1, if (ispolygonal(s, j), return(1))); \\ Michel Marcus, Aug 03 2023

CROSSREFS

Cf. A007504, A033997, A090466, A175133, A364693, A364694, A364696.

Sequence in context: A076212 A085621 A324101 * A091066 A277599 A103848

Adjacent sequences: A364692 A364693 A364694 * A364696 A364697 A364698

KEYWORD

nonn

AUTHOR

Paolo Xausa, Aug 03 2023

STATUS

approved