A194882 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A194882

Write n = C(i,4)+C(j,3)+C(k,2)+C(l,1) with i>j>k>l>=0; sequence gives i values.

3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8

(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

Table of n, a(n) for n=0..118.

CROSSREFS

Equals A127321 + 3.

Cf. A194882-A194884, A127324, A194885; A194847, A194848, A056558, A194849.

Sequence in context: A349992 A064042 A332325 * A096343 A351911 A069812

Adjacent sequences: A194879 A194880 A194881 * A194883 A194884 A194885

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Sep 04 2011

STATUS

approved