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.

A089647 Number of triangular partitions of n.

This page as a plain text file.
%I A089647 #8 Jun 10 2018 20:20:40
%S A089647 1,1,1,2,2,4,6,8,12,18,26,37,54,76,111,156,221,310,438,608,850,1178,
%T A089647 1633,2251,3104,4257,5837,7972,10866,14772,20042,27121,36625,49356,
%U A089647 66366,89077,119319,159547,212942,283753,377423,501274,664639,879963
%N A089647 Number of triangular partitions of n.
%C A089647 Number of ways of writing n as a sum [p(1,1) + p(1,2) + ... + p(1,k)] + [p(2,1) + ... + p(2,k-1)] + [p(3,1) + ... + p(3,k-2)] + ... + [p(k,1)] for some k =0, 1, 2, ..., so that in the triangular array {p(i,j)} the numbers are nonincreasing along rows and columns. All the p(i,j) are >= 1.
%H A089647 Jon E. Schoenfield, <a href="/A089647/b089647.txt">Table of n, a(n) for n = 0..64</a>
%e A089647 a(8)=12, as seen from the following list:
%e A089647 8...61..51..41..52..42..32..43..33..311.211.221
%e A089647 ....1...2...3...1...2...3...1...2...11..21..11.
%e A089647 ....................................1...1...1..
%Y A089647 Cf. A089299.
%K A089647 nonn,nice
%O A089647 0,4
%A A089647 _John W. Layman_, Jan 02 2004
%E A089647 More terms from _Jon E. Schoenfield_, Aug 06 2006