OFFSET
1,1
FORMULA
a(n) = A253249(n) + 1.
EXAMPLE
The a(n) chains for n = 1, 2, 4, 6, 8 (empty chains shown as 0):
0 0 0 0 0
1 1 1 1 1
2 2 2 2
2/1 4 3 4
2/1 6 8
4/1 2/1 2/1
4/2 3/1 4/1
4/2/1 6/1 4/2
6/2 8/1
6/3 8/2
6/2/1 8/4
6/3/1 4/2/1
8/2/1
8/4/1
8/4/2
8/4/2/1
MATHEMATICA
stableSets[u_, Q_]:=If[Length[u]==0, {{}}, With[{w=First[u]}, Join[stableSets[DeleteCases[u, w], Q], Prepend[#, w]&/@stableSets[DeleteCases[u, r_/; r==w||Q[r, w]||Q[w, r]], Q]]]];
Table[Length[stableSets[Divisors[n], !(Divisible[#1, #2]||Divisible[#2, #1])&]], {n, 10}]
CROSSREFS
A067824 is the case of chains starting with n (or ending with 1).
A074206 is the case of chains from n to 1.
A253249 is the nonempty case.
A000005 counts divisors.
A001055 counts factorizations.
A001222 counts prime factors with multiplicity.
A074206 counts chains of divisors from n to 1.
A122651 counts chains of divisors summing to n.
A167865 counts chains of divisors > 1 summing to n.
A334996 appears to count chains of divisors from n to 1 by length.
A337071 counts chains of divisors starting with n!.
A337255 counts chains of divisors starting with n by length.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Aug 23 2020
STATUS
approved