login

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”).

A205301
Last occurrence of n partitions in A204814.
4
1312, 1501, 2446, 2776, 4381, 3676, 4951, 6541, 5686, 7771, 8326, 7696, 8011, 10471, 9256, 9871, 11041, 11626, 15256, 12751, 15511, 15151, 14956, 19441, 16801, 20596, 20101, 22291, 17611, 17341, 18451, 21856, 19051, 21226, 23761, 20842, 24796, 22651, 22546
OFFSET
0,1
COMMENTS
Conjectured lower bound to be increasing for increasing n.
Related to Goldbach's conjecture.
LINKS
Donovan Johnson, Table of n, a(n) for n = 0..1000 (from search done for first 25*10^6 terms in A204814)
EXAMPLE
1312 is the last observed 0 so for n=0, a(0)=1312.
CROSSREFS
KEYWORD
nonn
AUTHOR
John W. Nicholson, Jan 27 2012
EXTENSIONS
a(10)-a(38) from Donovan Johnson, Jan 28 2012
STATUS
approved