The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A194885 Write n = C(i,4)+C(j,3)+C(k,2)+C(l,1) with i>j>k>l>=0; let L[n] = [i,j,k,l]; sequence gives list of quadruples L[n], n >= 0. 4
 3, 2, 1, 0, 4, 2, 1, 0, 4, 3, 1, 0, 4, 3, 2, 0, 4, 3, 2, 1, 5, 2, 1, 0, 5, 3, 1, 0, 5, 3, 2, 0, 5, 3, 2, 1, 5, 4, 1, 0, 5, 4, 2, 0, 5, 4, 2, 1, 5, 4, 3, 0, 5, 4, 3, 1, 5, 4, 3, 2, 6, 2, 1, 0, 6, 3, 1, 0, 6, 3, 2, 0, 6, 3, 2, 1, 6, 4, 1, 0, 6, 4, 2, 0, 6, 4, 2, 1, 6, 4, 3, 0, 6, 4, 3, 1, 6, 4, 3, 2, 6, 5, 1, 0, 6, 5, 2, 0, 6, 5, 2, 1, 6, 5, 3, 0, 6, 5, 3, 1, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Each n >= 0 has a unique representation as n = C(i,4)+C(j,3)+C(k,2)+C(l.1) with i>j>k>l>=0. This is the combinatorial number system of degree t = 4, where we get [A194882, A194883, A194884, A127324]. For degree t = 3 see A194847. REFERENCES D. E. Knuth, The Art of Computer Programming, vol. 4A, Combinatorial Algorithms, Section 7.2.1.3, Eq. (20), p. 360. LINKS EXAMPLE List of quadruples begins: [3, 2, 1, 0] [4, 2, 1, 0] [4, 3, 1, 0] [4, 3, 2, 0] [4, 3, 2, 1] [5, 2, 1, 0] [5, 3, 1, 0] [5, 3, 2, 0] [5, 3, 2, 1] [5, 4, 1, 0] [5, 4, 2, 0] ... CROSSREFS The four columns are [A194882, A194883, A194885, A127324], or equivalently [A127321+3, A127322+2, A127323+1, A127324]. Sequence in context: A319666 A307333 A031251 * A128317 A179753 A279318 Adjacent sequences:  A194882 A194883 A194884 * A194886 A194887 A194888 KEYWORD nonn,tabf AUTHOR N. J. A. Sloane, Sep 04 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 2 14:21 EDT 2020. Contains 334787 sequences. (Running on oeis4.)