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.

A037174 Primes which are not the sum of consecutive composite numbers.

This page as a plain text file.
%I A037174 #24 Aug 21 2023 15:01:56
%S A037174 2,3,5,7,11,13,47,61,73,107,167,179,313,347,421,479,719,863,1153,1213,
%T A037174 1283,1307,1523,3467,3733,4007,4621,4787,5087,5113,5413,7523,7703,
%U A037174 9817,10333,12347,12539,13381,17027,18553,19717,19813,23399,26003,31873,36097,38833
%N A037174 Primes which are not the sum of consecutive composite numbers.
%C A037174 It seems reasonable that a(n)/A079149(n) has an asymptote that could be estimated. - _Peter Munn_, Aug 21 2023
%H A037174 T. D. Noe, <a href="/A037174/b037174.txt">Table of n, a(n) for n = 1..3492</a> (terms less than 2*10^9)
%p A037174 N:= 5000:
%p A037174 primes,comps:= selectremove(isprime,{$2..N}):
%p A037174 M:= nops(comps):
%p A037174 X:= primes:
%p A037174 for n from 1 to floor(sqrt(2*N)) do
%p A037174 i:= 1;
%p A037174 T:= add(comps[k],k=1..n);
%p A037174 while T <= N do
%p A037174 X := X minus {T};
%p A037174 if i + n > M then break fi;
%p A037174 T := T + comps[i+n] - comps[i];
%p A037174 i := i+1;
%p A037174 od;
%p A037174 od:
%p A037174 X;
%p A037174 # _Robert Israel_, Jun 24 2008
%Y A037174 Subsequence of A079149.
%Y A037174 With {1}, the complement of A133576.
%Y A037174 Primes that are the sum of specific numbers of consecutive composite numbers: A060254 (2), A060328 (3), A060329 (4), A060330 (5), A060331 (6), A060332 (7), A060333 (8).
%Y A037174 Cf. A050940, A197227.
%K A037174 nonn
%O A037174 1,1
%A A037174 _Naohiro Nomoto_
%E A037174 More terms from _Jud McCranie_, Jul 12 2000
%E A037174 Corrected by _T. D. Noe_, Aug 15 2008