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.

A205301 Last occurrence of n partitions in A204814.

Original entry on oeis.org

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

Views

Author

John W. Nicholson, Jan 27 2012

Keywords

Comments

Conjectured lower bound to be increasing for increasing n.
Related to Goldbach's conjecture.

Examples

			1312 is the last observed 0 so for n=0, a(0)=1312.
		

Crossrefs

Extensions

a(10)-a(38) from Donovan Johnson, Jan 28 2012