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”).
%I #15 Mar 31 2012 10:28:36
%S 1312,1501,2446,2776,4381,3676,4951,6541,5686,7771,8326,7696,8011,
%T 10471,9256,9871,11041,11626,15256,12751,15511,15151,14956,19441,
%U 16801,20596,20101,22291,17611,17341,18451,21856,19051,21226,23761,20842,24796,22651,22546
%N Last occurrence of n partitions in A204814.
%C Conjectured lower bound to be increasing for increasing n.
%C Related to Goldbach's conjecture.
%H Donovan Johnson, <a href="/A205301/b205301.txt">Table of n, a(n) for n = 0..1000</a> (from search done for first 25*10^6 terms in A204814)
%e 1312 is the last observed 0 so for n=0, a(0)=1312.
%Y Cf. A104272, A173634, A204814.
%K nonn
%O 0,1
%A _John W. Nicholson_, Jan 27 2012
%E a(10)-a(38) from _Donovan Johnson_, Jan 28 2012