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.

A177740 Triangle read by rows in which row n lists the number of parts in each of those partitions of n that have every part >=3.

This page as a plain text file.
%I A177740 #8 Sep 08 2022 08:45:53
%S A177740 1,1,1,1,2,1,2,1,2,2,1,2,2,3,1,2,2,2,3,1,2,2,2,3,3,1,2,2,2,2,3,3,3,4,
%T A177740 1,2,2,2,2,3,3,3,3,4,1,2,2,2,2,3,2,3,3,3,3,4,4,1,2,2,2,2,3,2,3,3,3,3,
%U A177740 3,4,3,4,4,5,1,2,2,2,2,3,2,3,2,3,3,3,3,4,3,3,4,4,4,4,5
%N A177740 Triangle read by rows in which row n lists the number of parts in each of those partitions of n that have every part >=3.
%C A177740 The ordering of the partitions is described in A176210.
%H A177740 J. S. Kimberley, <a href="/A177740/b177740.txt">Rows 3..39 of A177740 triangle, flattened</a>.
%e A177740 3: 3 (1)
%e A177740 4: 4 (1)
%e A177740 5: 5 (1)
%e A177740 6: 6 or 3,3 (1, 2)
%e A177740 7: 7 or 3,4 (1, 2)
%e A177740 8: 8, 3,5 or 4,4 (1, 2, 2)
%e A177740 so sequence begins 1, 1, 1, 1,2, 1,2, ...
%o A177740 (Magma) [ #part: part in RestrictedPartitions(n,{3..n}), n in [0..16]];
%Y A177740 The length of the rows is given by A008483.
%Y A177740 Cf. A128628 for unrestricted partitions.
%K A177740 easy,nonn,tabf
%O A177740 3,5
%A A177740 _Jason Kimberley_, May 13 2010
%E A177740 Edited (including b-file) by _N. J. A. Sloane_, Oct 05 2010