A330350 Table of strictly decreasing sequences with terms in {0, ..., 9}, sorted by length, then lexicographically.

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, 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, 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

Offset: 1

Author

M. F. Hasler, Dec 11 2019

Keywords

• nonn
• fini
• full

Comments

Row n lists the digits of A009995(n), just as row n < 1024 of A272011 lists the digits of A262557(n).

Examples

			The first rows start
   n | row n
   1 | 0,
   2 | 1,
    ...
  10 | 9,
  11 | 1, 0,
  12 | 2, 0,
  13 | 2, 1,
  14 | 3, 0,
  15 | 3, 1,
  16 | 3, 2,
  17 | 4, 0,
    ...
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), ...
		

Links

• M. F. Hasler, Table of n, a(n) for n = 1..5120 (rows 1 .. 1023, flattened).
• B. Sury, Macaulay Expansion, Amer. Math. Monthly 121 (2014), no. 4, 359--360. MR3183022.

Crossrefs

Cf. A009995, A272011, A262557.

Programs

PARI

concat(0,[digits(n)|n<-[1..99],is_A009995(n)])