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.

A364694 Polygonal numbers of order greater than 2 (A090466) which are the sum of the first k primes, for some k > 0.

This page as a plain text file.
%I A364694 #16 Aug 07 2023 08:32:27
%S A364694 10,28,58,100,129,160,238,328,381,501,568,639,712,874,963,1060,1161,
%T A364694 1264,1371,1480,1593,1720,1851,2127,2276,2427,2584,2914,3087,3447,
%U A364694 3831,4227,4438,4888,5350,5589,5830,6081,6601,6870,8275,10191,10887,11599,12339,12718
%N A364694 Polygonal numbers of order greater than 2 (A090466) which are the sum of the first k primes, for some k > 0.
%H A364694 Paolo Xausa, <a href="/A364694/b364694.txt">Table of n, a(n) for n = 1..10000</a>
%H A364694 Wikipedia, <a href="https://en.wikipedia.org/wiki/Polygonal_number">Polygonal number</a>.
%H A364694 <a href="/index/Pol#polygonal_numbers">Index to sequences related to polygonal numbers</a>
%e A364694 28 is a term because it's both a triangular number and the sum of the first 5 primes (2 + 3 + 5 + 7 + 11).
%e A364694 58 is a term because it's both an octagonal number and the sum of the first 7 primes (2 + 3 + 5 + 7 + 11 + 13 + 17).
%t A364694 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 *)
%t A364694 A364694list[kmax_]:=Select[Accumulate[Prime[Range[kmax]]],A364693Q];A364694list[100]
%Y A364694 Intersection of A007504 with A090466.
%Y A364694 Cf. A061890, A066527, A364691, A364695.
%K A364694 nonn
%O A364694 1,1
%A A364694 _Paolo Xausa_, Aug 03 2023