OFFSET
1,2
EXAMPLE
The a(1) = 1 through a(5) = 6 chains:
(1) (1/1) (1/1/1) (1/1/1/1) (1/1/1/1/1)
(2/1) (3/1/1) (2/1/1/1) (5/1/1/1/1)
(2/2) (3/3/1) (2/2/1/1) (5/5/1/1/1)
(3/3/3) (2/2/2/1) (5/5/5/1/1)
(2/2/2/2) (5/5/5/5/1)
(4/1/1/1) (5/5/5/5/5)
(4/2/1/1)
(4/2/2/1)
(4/2/2/2)
(4/4/1/1)
(4/4/2/1)
(4/4/2/2)
(4/4/4/1)
(4/4/4/2)
(4/4/4/4)
MATHEMATICA
Table[Length[Select[Tuples[Divisors[n], n], OrderedQ[#]&&And@@Divisible@@@Reverse/@Partition[#, 2, 1]&]], {n, 10}]
CROSSREFS
Diagonal n = k - 1 of the array A077592.
Chains of length n - 1 are counted by A163767.
Diagonal n = k of the array A334997.
The version counting all multisets of divisors (not just chains) is A343935.
A000005(n) counts divisors of n.
A067824(n) counts strict chains of divisors starting with n.
A074206(n) counts strict chains of divisors from n to 1.
A146291(n,k) counts divisors of n with k prime factors (with multiplicity).
A251683(n,k-1) counts strict k-chains of divisors from n to 1.
A253249(n) counts nonempty chains of divisors of n.
A334996(n,k) counts strict k-chains of divisors from n to 1.
A337255(n,k) counts strict k-chains of divisors starting with n.
A343658(n,k) counts k-multisets of divisors of n.
KEYWORD
nonn
AUTHOR
Gus Wiseman, May 05 2021
STATUS
approved