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.

A194449 Largest part minus the number of parts > 1 in the n-th region of the set of partitions of j, if 1 <= n <= A000041(j).

Original entry on oeis.org

1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 2, 2, 3, 3, 3, 1, 2, 2, 2, 4, 3, 1, 2, 3, 3, 3, 2, 4, 4, 1, 1, 2, 2, 2, 4, 3, 1, 3, 5, 5, 4, -2, 2, 3, 3, 3, 2, 4, 4, 1, 4, 3, 5, 6, 5, -3, 1, 2, 2, 2, 4, 3, 1, 3, 5, 5, 4, -2, 2, 4, 4, 5, 3, 6, 6, 5, -9
Offset: 1

Views

Author

Omar E. Pol, Dec 10 2011

Keywords

Comments

Also triangle read by rows: T(j,k) = largest part minus the numbers of parts > 1 in the k-th region of the last section of the set of partitions of j. It appears that the sum of row j is equal to A000041(j-1). For the definition of "region" of the set of partitions of j see A206437. See also A135010.

Examples

			The 7th region of the shell model of partitions is [5, 2, 1, 1, 1, 1, 1]. The largest part is 5 and the number of parts > 1 is 2, so a(7) = 5 - 2 = 3 (see an illustration in the link section).
Written as an irregular triangle T(j,k) begins:
1;
1;
2;
1,2;
2,3;
1,2,2,2;
2,3,3,3;
1,2,2,2,4,3,1;
2,3,3,3,2,4,4,1;
1,2,2,2,4,3,1,3,5,5,4,-2;
2,3,3,3,2,4,4,1,4,3,5,6,5,-3;
1,2,2,2,4,3,1,3,5,5,4,-2,2,4,4,5,3,6,6,5,-9;
		

Crossrefs

Formula

a(n) = A141285(n) - A194448(n).