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.

A160648 Second differences of sequence A160644.

Original entry on oeis.org

0, 1, 0, 0, 2, 0, 1, 4, 2, 3, 9, 6, 11, 19, 19, 27, 44, 49, 68, 98, 118, 157, 220, 268, 354, 473, 591, 765, 1003, 1254, 1609, 2071, 2597, 3293, 4192, 5236, 6594, 8308, 10345, 12926, 16163, 20031, 24886, 30890, 38123, 47081, 58102, 71381, 87704, 107643
Offset: 1

Views

Author

Alford Arnold, May 25 2009

Keywords

Comments

A160644 bisects sequence A053445 which counts unrestricted partitions such that the two largest values match and that no part is less than two.
Conjecture: a(n) counts unrestricted partitions of even numbers such that
the three largest values match and that, after "222", no part is less than three.

Examples

			a(n) begins 0 1 0 0 2 0 1 4 2 3 9 ... and counts 222; 444,3333;
666,5553,444433,333333; 5555,44444; 6664,55543,444433;
888,6666,7773,55554,66633,444444,555333,4443333,33333333; ...
		

Crossrefs