login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A194849
Write n = C(i,3)+C(j,2)+C(k,1) with i>j>k>=0; let L[n] = [i,j,k]; sequence gives list of triples L[n], n >= 0.
5
2, 1, 0, 3, 1, 0, 3, 2, 0, 3, 2, 1, 4, 1, 0, 4, 2, 0, 4, 2, 1, 4, 3, 0, 4, 3, 1, 4, 3, 2, 5, 1, 0, 5, 2, 0, 5, 2, 1, 5, 3, 0, 5, 3, 1, 5, 3, 2, 5, 4, 0, 5, 4, 1, 5, 4, 2, 5, 4, 3, 6, 1, 0, 6, 2, 0, 6, 2, 1, 6, 3, 0, 6, 3, 1, 6, 3, 2, 6, 4, 0, 6, 4, 1, 6, 4, 2, 6, 4, 3, 6, 5, 0, 6, 5, 1, 6, 5, 2, 6, 5, 3, 6, 5, 4, 7, 1, 0, 7, 2, 0, 7, 2, 1, 7, 3, 0, 7, 3, 1, 7, 3, 2, 7, 4
OFFSET
0,1
REFERENCES
D. E. Knuth, The Art of Computer Programming, vol. 4A, Combinatorial Algorithms, Section 7.2.1.3, Eq. (20), p. 360.
EXAMPLE
List of triples begins:
[2, 1, 0]
[3, 1, 0]
[3, 2, 0]
[3, 2, 1]
[4, 1, 0]
[4, 2, 0]
[4, 2, 1]
[4, 3, 0]
[4, 3, 1]
[4, 3, 2]
...
CROSSREFS
The three columns are [A194847, A194848, A056558], or equivalently [A056556+2, A056557+1, A056558]. See A194847 for further information.
Sequence in context: A168016 A342301 A029323 * A071802 A110355 A219659
KEYWORD
nonn,tabf
AUTHOR
N. J. A. Sloane, Sep 03 2011
STATUS
approved