|
%I #19 Dec 11 2019 22:25:13
%S 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 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 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 Table of strictly decreasing sequences with terms in {0, ..., 9}, sorted by length, then lexicographically.
%C Row n lists the digits of A009995(n), just as row n < 1024 of A272011 lists the digits of A262557(n).
%H M. F. Hasler, <a href="/A330350/b330350.txt">Table of n, a(n) for n = 1..5120</a> (rows 1 .. 1023, flattened).
%H 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 The first rows start
%e n | row n
%e 1 | 0,
%e 2 | 1,
%e ...
%e 10 | 9,
%e 11 | 1, 0,
%e 12 | 2, 0,
%e 13 | 2, 1,
%e 14 | 3, 0,
%e 15 | 3, 1,
%e 16 | 3, 2,
%e 17 | 4, 0,
%e ...
%e 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 (PARI) concat(0,[digits(n)|n<-[1..99],is_A009995(n)])
%Y Cf. A009995, A272011, A262557.
%K nonn,fini,full
%O 1,3
%A _M. F. Hasler_, Dec 11 2019
|
