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 A330350 #19 Dec 11 2019 22:25:13 %S A330350 0,1,2,3,4,5,6,7,8,9,1,0,2,0,2,1,3,0,3,1,3,2,4,0,4,1,4,2,4,3,5,0,5,1, %T A330350 5,2,5,3,5,4,6,0,6,1,6,2,6,3,6,4,6,5,7,0,7,1,7,2,7,3,7,4,7,5,7,6,8,0, %U A330350 8,1,8,2,8,3,8,4,8,5,8,6,8,7,9,0,9,1,9,2,9,3,9,4,9,5,9,6,9,7,9,8 %N A330350 Table of strictly decreasing sequences with terms in {0, ..., 9}, sorted by length, then lexicographically. %C A330350 Row n lists the digits of A009995(n), just as row n < 1024 of A272011 lists the digits of A262557(n). %H A330350 M. F. Hasler, <a href="/A330350/b330350.txt">Table of n, a(n) for n = 1..5120</a> (rows 1 .. 1023, flattened). %H A330350 B. Sury, <a href="http://www.jstor.org/stable/10.4169/amer.math.monthly.121.04.359">Macaulay Expansion</a>, Amer. Math. Monthly 121 (2014), no. 4, 359--360. MR3183022. %e A330350 The first rows start %e A330350 n | row n %e A330350 1 | 0, %e A330350 2 | 1, %e A330350 ... %e A330350 10 | 9, %e A330350 11 | 1, 0, %e A330350 12 | 2, 0, %e A330350 13 | 2, 1, %e A330350 14 | 3, 0, %e A330350 15 | 3, 1, %e A330350 16 | 3, 2, %e A330350 17 | 4, 0, %e A330350 ... %e A330350 The Sury paper lists the first rows of length 3, row 56 = (2, 1, 0), row 57 = (3, 1, 0), row 58 = (3, 2, 0), row 59 = (3, 2, 1), row 60 = (4, 1, 0), ... %o A330350 (PARI) concat(0,[digits(n)|n<-[1..99],is_A009995(n)]) %Y A330350 Cf. A009995, A272011, A262557. %K A330350 nonn,fini,full %O A330350 1,3 %A A330350 _M. F. Hasler_, Dec 11 2019