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.

A207779 Largest part plus the number of parts of the n-th region of the section model of partitions.

Original entry on oeis.org

2, 4, 6, 3, 9, 4, 12, 3, 6, 4, 17, 4, 7, 5, 22, 3, 6, 4, 10, 6, 5, 30, 4, 7, 5, 11, 4, 8, 6, 39, 3, 6, 4, 10, 6, 5, 15, 5, 9, 7, 6, 52, 4, 7, 5, 11, 4, 8, 6, 17, 6, 5, 11, 8, 7, 67, 3, 6, 4, 10, 6, 5, 15, 5, 9, 7, 6, 22, 4, 8, 6, 13, 5, 10, 8
Offset: 1

Views

Author

Omar E. Pol, Mar 08 2012

Keywords

Comments

Also semiperimeter of the n-th region of the geometric version of the section model of partitions. Note that a(n) is easily viewable as the sum of two perpendicular segments with a shared vertex. The horizontal segment has length A141285(n) and the vertical segment has length A194446(n). The difference between these two segments gives A194447(n). See also an illustration in the Links section. For the definition of "region" see A206437.
Also triangle read by rows: T(n,k) = largest part plus the number of parts of the k-th region of the last section of the set of partitions of n.

Examples

			Written as a triangle begins:
2;
4;
6;
3, 9;
4, 12;
3, 6, 4, 17;
4, 7, 5, 22;
3, 6, 4, 10, 6, 5, 30;
4, 7, 5, 11, 4, 8, 6, 39;
3, 6, 4, 10, 6, 5, 15, 5, 9, 7, 6, 52;
		

Crossrefs

Row n has length A187219(n). Last term of row n is A133041(n). Where record occur give A000041, n >= 1.

Formula

a(n) = A141285(n) + A194446(n).