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