%I #21 Jul 10 2021 19:31:52
%S 9,15,21,29,39,47,57,65,71,93,99,115,129,137,143,149,183,189,205,219,
%T 225,241,251,269,287,309,317,327,335,357,371,377,417,419,441,459,465,
%U 493,503,509,543,545,567,587,597,609,621,653,657,695,701,723,725,743,749,755,785
%N a(n) is the largest odd number k such that 9, 11, ..., k are sums of 3 of first n odd primes.
%C From _Rémy Sigrist_, Aug 20 2017: (Start)
%C The following table gives the first index (n0) of the term that starts the first run of j consecutive equal terms for j=1..6:
%C j n0 a(n0)
%C - ---- ------
%C 1 1 9
%C 2 96 1511
%C 3 131 2205
%C 4 334 6733
%C 5 5959 176843
%C 6 3079 84731
%C (End)
%H Rémy Sigrist, <a href="/A007962/b007962.txt">Table of n, a(n) for n = 1..10000</a>
%H K. Kashihara, <a href="http://www.gallup.unm.edu/~smarandache/Kashihara.pdf">Comments and Topics on Smarandache Notions and Problems</a>, Erhus University Press, 1996, 50 pages. See page 20.
%H K. Kashihara, <a href="/A011772/a011772.pdf">Comments and Topics on Smarandache Notions and Problems</a>, Erhus University Press, 1996, 50 pages. [Cached copy] See page 20.
%H F. Smarandache, <a href="http://www.gallup.unm.edu/~smarandache/OPNS.pdf">Only Problems, Not Solutions!</a>
%H Rémy Sigrist, <a href="/A007962/a007962.gp.txt">PARI program for A007962</a>
%F a(n) << n log n. - _Charles R Greathouse IV_, Sep 19 2012
%t nmax = 100; p = pq = pqr = {}; u = 9;
%t Reap[For[n = 1, n <= nmax, n++, o = Prime[n+1]; p = Union[p, {o}]; pq = Union[pq, p+o]; pqr = Union[pqr, pq+o]; While[MemberQ[pqr, u], u += 2]; Sow[u-2]]][[2, 1]] (* _Jean-François Alcover_, Dec 19 2017, after _Rémy Sigrist_ *)
%o (PARI) See Links section.
%K nonn
%O 1,1
%A R. Muller