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.

A196931 Triangle read by rows in which row n lists in nondecreasing order the smallest part of every partition of n.

This page as a plain text file.
%I A196931 #31 Dec 28 2023 09:25:31
%S A196931 0,1,1,2,1,1,3,1,1,1,2,4,1,1,1,1,1,2,5,1,1,1,1,1,1,1,2,2,3,6,1,1,1,1,
%T A196931 1,1,1,1,1,1,1,2,2,3,7,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,3,4,8,1,
%U A196931 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1
%N A196931 Triangle read by rows in which row n lists in nondecreasing order the smallest part of every partition of n.
%C A196931 If n >= 1, row n lists the smallest parts of every partition of n in the order produced by the shell model of partitions of A135010, hence row n lists the parts of the last section of the set of partitions of n, except the emergent parts (See A182699).
%C A196931 Row n has length A000041(n). Row sums give A046746. Right border of triangle gives A001477. Row n starts with A000041(n-1) ones, n >= 1.
%e A196931 Written as a triangle:
%e A196931   0,
%e A196931   1,
%e A196931   1,2,
%e A196931   1,1,3,
%e A196931   1,1,1,2,4,
%e A196931   1,1,1,1,1,2,5,
%e A196931   1,1,1,1,1,1,1,2,2,3,6
%e A196931   1,1,1,1,1,1,1,1,1,1,1,2,2,3,7,
%e A196931   1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,3,4,8,
%e A196931   ...
%Y A196931 Mirror of triangle A182715.
%Y A196931 Cf. A000041, A046746, A135010, A138121, A141285, A182699, A183152, A193827, A196930.
%K A196931 nonn,tabf
%O A196931 0,4
%A A196931 _Omar E. Pol_, Oct 21 2011