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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007962 a(n) is the largest odd number k such that 9, 11, ..., k are sums of 3 of first n odd primes. 2
9, 15, 21, 29, 39, 47, 57, 65, 71, 93, 99, 115, 129, 137, 143, 149, 183, 189, 205, 219, 225, 241, 251, 269, 287, 309, 317, 327, 335, 357, 371, 377, 417, 419, 441, 459, 465, 493, 503, 509, 543, 545, 567, 587, 597, 609, 621, 653, 657, 695, 701, 723, 725, 743, 749, 755, 785 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
From Rémy Sigrist, Aug 20 2017: (Start)
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:
j n0 a(n0)
- ---- ------
1 1 9
2 96 1511
3 131 2205
4 334 6733
5 5959 176843
6 3079 84731
(End)
LINKS
K. Kashihara, Comments and Topics on Smarandache Notions and Problems, Erhus University Press, 1996, 50 pages. See page 20.
K. Kashihara, Comments and Topics on Smarandache Notions and Problems, Erhus University Press, 1996, 50 pages. [Cached copy] See page 20.
FORMULA
a(n) << n log n. - Charles R Greathouse IV, Sep 19 2012
MATHEMATICA
nmax = 100; p = pq = pqr = {}; u = 9;
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 *)
PROG
(PARI) See Links section.
CROSSREFS
Sequence in context: A179384 A225513 A331662 * A061254 A175626 A096788
KEYWORD
nonn
AUTHOR
R. Muller
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 14:21 EDT 2024. Contains 371254 sequences. (Running on oeis4.)