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.
%I A194883 #5 Mar 30 2012 16:52:03 %S A194883 2,2,3,3,3,2,3,3,3,4,4,4,4,4,4,2,3,3,3,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5, %T A194883 5,2,3,3,3,4,4,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, %U A194883 6,6,2,3,3,3,4,4,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,7,7,7,7,7,7,7,7,7,7,7,7,7,7 %N A194883 Write n = C(i,4)+C(j,3)+C(k,2)+C(l,1) with i>j>k>l>=0; sequence gives j values. %C A194883 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. %D A194883 D. E. Knuth, The Art of Computer Programming, vol. 4A, Combinatorial Algorithms, Section 7.2.1.3, Eq. (20), p. 360. %Y A194883 Equals A127322 + 2. %Y A194883 Cf. A194882-A194884, A127324, A194885; A194847, A194848, A056558, A194849. %K A194883 nonn %O A194883 0,1 %A A194883 _N. J. A. Sloane_, Sep 04 2011