A337074 -id:A337074 - cp's OEIS frontend

A067824 a(1) = 1; for n > 1, a(n) = 1 + Sum_{0 < d < n, d|n} a(d).

1, 2, 2, 4, 2, 6, 2, 8, 4, 6, 2, 16, 2, 6, 6, 16, 2, 16, 2, 16, 6, 6, 2, 40, 4, 6, 8, 16, 2, 26, 2, 32, 6, 6, 6, 52, 2, 6, 6, 40, 2, 26, 2, 16, 16, 6, 2, 96, 4, 16, 6, 16, 2, 40, 6, 40, 6, 6, 2, 88, 2, 6, 16, 64, 6, 26, 2, 16, 6, 26, 2, 152, 2, 6, 16, 16, 6, 26, 2, 96, 16, 6, 2, 88, 6, 6, 6, 40, 2, 88, 6, 16, 6, 6, 6, 224, 2, 16, 16, 52

Offset: 1

Reinhard Zumkeller, Feb 08 2002

nonn

By a result of Karhumaki and Lifshits, this is also the number of polynomials p(x) with coefficients in {0,1} that divide x^n-1 and such that (x^n-1)/ {(x-1)p(x)} has all coefficients in {0,1}.
The number of tiles of a discrete interval of length n (an interval of Z). - Eric H. Rivals (rivals(AT)lirmm.fr), Mar 13 2007
Bodini and Rivals proved this is the number of tiles of a discrete interval of length n and also is the number (A107067) of polynomials p(x) with coefficients in {0,1} that divide x^n-1 and such that (x^n-1)/ {(x-1)p(x)} has all coefficients in {0,1} (Bodini, Rivals, 2006). This structure of such tiles is also known as Krasner's factorization (Krasner and Ranulac, 1937). The proof also gives an algorithm to recognize if a set is a tile in optimal time and in this case, to compute the smallest interval it can tile (Bodini, Rivals, 2006). - Eric H. Rivals (rivals(AT)lirmm.fr), Mar 13 2007
Number of lone-child-avoiding rooted achiral (or generalized Bethe) trees with positive integer leaves summing to n, where a rooted tree is lone-child-avoiding if all terminal subtrees have at least two branches, and achiral if all branches directly under any given node are equal. For example, the a(6) = 6 trees are 6, (111111), (222), ((11)(11)(11)), (33), ((111)(111)). - Gus Wiseman, Jul 13 2018. Updated Aug 22 2020.
From Gus Wiseman, Aug 20 2020: (Start)
Also the number of strict chains of divisors starting with n. For example, the a(n) chains for n = 1, 2, 4, 6, 8, 12 are:
  1  2    4      6      8        12
     2/1  4/1    6/1    8/1      12/1
          4/2    6/2    8/2      12/2
          4/2/1  6/3    8/4      12/3
                 6/2/1  8/2/1    12/4
                 6/3/1  8/4/1    12/6
                        8/4/2    12/2/1
                        8/4/2/1  12/3/1
                                 12/4/1
                                 12/4/2
                                 12/6/1
                                 12/6/2
                                 12/6/3
                                 12/4/2/1
                                 12/6/2/1
                                 12/6/3/1
(End)
a(n) is the number of chains including n of the divisor lattice of divisors of n, which is to say, a(n) is the number of (d_1,d_2,...,d_k) such that d_1 < d_2 < ... < d_k = n and d_i divides d_{i+1} for 1 <= i <= k-1. Using this definition, the recurrence a(n) = 1 + Sum_{0 < d < n, d|n} a(d) is evident by enumerating the preceding element of n in the chains. If we count instead the chains whose LCM of members is n, then a(1) would be 2 because the empty chain is included, and we would obtain 2*A074206(n). - Jianing Song, Aug 21 2024

			a(12) = 1 + a(6) + a(4) + a(3) + a(2) + a(1)
= 1+(1+a(3)+a(2)+a(1))+(1+a(2)+a(1))+(1+a(1))+(1+a(1))+(1)
= 1+(1+(1+a(1))+(1+a(1))+1)+(1+(1+a(1))+1)+(1+1)+(1+1)+(1)
= 1+(1+(1+1)+(1+1)+1)+(1+(1+1)+1)+(1+1)+(1+1)+(1)
= 1 + 6 + 4 + 2 + 2 + 1 = 16.

Olivier Bodini and Eric Rivals. Tiling an Interval of the Discrete Line. In M. Lewenstein and G. Valiente, editors, Proc. of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM), volume 4009 of Lecture Notes in Computer Science, pages 117-128. Springer Verlag, 2006.
Juhani Karhumaki, Yury Lifshits and Wojciech Rytter, Tiling Periodicity, in Combinatorial Pattern Matching, Lecture Notes in Computer Science, Volume 4580/2007, Springer-Verlag.

Reinhard Zumkeller, Table = of n, a(n) for n = 1..10000
Olivier Bodini and Eric Rivals, Tiling an Interval of the Discrete Line
Thomas Fink, Recursively divisible numbers, arXiv:1912.07979 [math.NT], 2019. See Table 1 p. 8.
T. M. A. Fink, Properties of the recursive divisor function and the number of ordered factorizations, arXiv:2307.09140 [math.NT], 2023.
Michael Greene and Robin Michaels, One Dimensional Tilings, Eureka (Cambridge) 54 (1996), 4-13.
G. Hajos, Sur le problème de factorisation des groupes cycliques, Acta Math. Acad. Sci. Hung., 1:189-195, 1950.
J. Karhumaki and Y. Lifshits, Tiling periodicity.
M. Krasner and B. Ranulac, Sur une propriété des polynomes de la division du cercle, Comptes Rendus Académie des Sciences Paris, 240:397-399, 1937.
Eric H. Rivals, Tiling
Index entries for sequences computed from exponents in factorization of n

Cf. A000005, A001678, A003238, A107067, A107748, A167865, A316782.
Cf. A122408 (fixed points).
Inverse Möbius transform of A074206.
A001055 counts factorizations.
A008480 counts maximal chains of divisors starting with n.
A074206 counts chains of divisors from n to 1.
A253249 counts nonempty chains of divisors.
A337070 counts chains of divisors starting with A006939(n).
A337071 counts chains of divisors starting with n!.
A337256 counts chains of divisors.
Cf. A001221, A001222, A002033, A124010, A337074, A337105, A378223, A378225 (Dirichlet inverse).

a067824 n = 1 + sum (map a067824 [d | d <- [1..n-1], mod n d == 0])
-- Reinhard Zumkeller, Oct 13 2011

a:= proc(n) option remember;
      1+add(a(d), d=numtheory[divisors](n) minus {n})
    end:
seq(a(n), n=1..100);  # Alois P. Heinz, Apr 17 2021

a[1]=1; a[n_] := a[n] = 1+Sum[If[Mod[n,d]==0, a[d], 0], {d, 1, n-1}]; Array[a,100] (* Jean-François Alcover, Apr 28 2011 *)

A=vector(100);A[1]=1; for(n=2,#A,A[n]=1+sumdiv(n,d,A[d])); A \\ Charles R Greathouse IV, Nov 20 2012

a(n) = 2*A074206(n), n>1. - Vladeta Jovovic, Jul 03 2005
a(p^k) = 2^k for primes p. - Reinhard Zumkeller, Sep 03 2006
a(n) = Sum_{d|n} A002033(d-1) = Sum_{d|n} A074206(d). - Gus Wiseman, Jul 13 2018
Dirichlet g.f.: zeta(s) / (2 - zeta(s)). - Álvar Ibeas, Dec 30 2018
G.f. A(x) satisfies: A(x) = x/(1 - x) + Sum_{k>=2} A(x^k). - Ilya Gutkovskiy, May 18 2019

Entry revised by N. J. A. Sloane, Aug 27 2006

A337105 Number of strict chains of divisors from n! to 1.

Original entry on oeis.org

1, 1, 1, 3, 20, 132, 1888, 20128, 584000, 17102016, 553895936, 11616690176, 743337949184, 19467186157568, 999551845713920, 66437400489711616, 10253161206302064640, 388089999627661557760, 53727789519052432998400, 2325767421950553303285760, 365546030278816140131041280

Offset: 0

Gus Wiseman, Aug 17 2020

nonn

			The a(4) = 20 chains:
  24/1  24/2/1   24/4/2/1   24/8/4/2/1
        24/3/1   24/6/2/1   24/12/4/2/1
        24/4/1   24/6/3/1   24/12/6/2/1
        24/6/1   24/8/2/1   24/12/6/3/1
        24/8/1   24/8/4/1
        24/12/1  24/12/2/1
                 24/12/3/1
                 24/12/4/1
                 24/12/6/1

Andrew Howroyd, Table of n, a(n) for n = 0..200

A325617 is the maximal case.
A336941 is the version for superprimorials.
A337104 counts the case with distinct prime multiplicities.
A337071 is the case not necessarily ending with 1.
A000005 counts divisors.
A000142 lists factorial numbers.
A001055 counts factorizations.
A027423 counts divisors of factorial numbers.
A067824 counts chains of divisors starting with n.
A074206 counts chains of divisors from n to 1.
A076716 counts factorizations of factorial numbers.
A253249 counts chains of divisors.
A336423 counts chains using A130091, with maximal case A336569.
A336942 counts chains using A130091 from A006939(n) to 1.
Cf. A001013, A001055, A022559, A124010, A167865, A337070, A337074.

b:= proc(n) option remember; 1 +
      add(b(d), d=numtheory[divisors](n) minus {n})
    end:
a:= n-> ceil(b(n!)/2):
seq(a(n), n=0..14);  # Alois P. Heinz, Aug 23 2020

chnsc[n_]:=Prepend[Join@@Table[Prepend[#,n]&/@chnsc[d],{d,DeleteCases[Divisors[n],1|n]}],{n}];
Table[Length[chnsc[n!]],{n,0,5}]

a(n) = A337071(n)/2 for n > 1.

a(n) = A074206(n!).

a(19)-a(20) from Alois P. Heinz, Aug 22 2020

A337070 Number of strict chains of divisors starting with the superprimorial A006939(n).

Original entry on oeis.org

1, 2, 16, 1208, 1383936, 32718467072, 20166949856488576, 391322675415566237681536

Offset: 0

Gus Wiseman, Aug 15 2020

The n-th superprimorial is A006939(n) = Product_{i = 1..n} prime(i)^(n - i + 1).

			The a(0) = 1 through a(2) = 16 chains:
  1  2    12
     2/1  12/1
          12/2
          12/3
          12/4
          12/6
          12/2/1
          12/3/1
          12/4/1
          12/4/2
          12/6/1
          12/6/2
          12/6/3
          12/4/2/1
          12/6/2/1
          12/6/3/1

A022915 is the maximal case.
A076954 can be used instead of A006939 (cf. A307895, A325337).
A336571 is the case with distinct prime multiplicities.
A336941 is the case ending with 1.
A337071 is the version for factorials.
A000005 counts divisors.
A000142 counts divisors of superprimorials.
A006939 lists superprimorials or Chernoff numbers.
A067824 counts chains of divisors starting with n.
A074206 counts chains of divisors from n to 1.
A253249 counts chains of divisors.
A317829 counts factorizations of superprimorials.
Cf. A001055, A002033, A167865, A181818, A336420, A336423, A336942, A337074.

chern[n_]:=Product[Prime[i]^(n-i+1),{i,n}];
chnsc[n_]:=If[n==1,{{1}},Prepend[Join@@Table[Prepend[#,n]&/@chnsc[d],{d,Most[Divisors[n]]}],{n}]];
Table[Length[chnsc[chern[n]]],{n,0,3}]

a(n) = 2*A336941(n) for n > 0.

a(n) = A067824(A006939(n)).

A337071 Number of strict chains of divisors starting with n!.

Original entry on oeis.org

1, 1, 2, 6, 40, 264, 3776, 40256, 1168000, 34204032, 1107791872, 23233380352, 1486675898368, 38934372315136, 1999103691427840, 132874800979423232, 20506322412604129280, 776179999255323115520, 107455579038104865996800, 4651534843901106606571520, 731092060557632280262082560

Offset: 0

Gus Wiseman, Aug 16 2020

nonn

			The a(1) = 1 through a(3) = 6 chains:
  1  2    6
     2/1  6/1
          6/2
          6/3
          6/2/1
          6/3/1
The a(4) = 40 chains:
  24  24/1   24/2/1   24/4/2/1   24/8/4/2/1
      24/2   24/3/1   24/6/2/1   24/12/4/2/1
      24/3   24/4/1   24/6/3/1   24/12/6/2/1
      24/4   24/4/2   24/8/2/1   24/12/6/3/1
      24/6   24/6/1   24/8/4/1
      24/8   24/6/2   24/8/4/2
      24/12  24/6/3   24/12/2/1
             24/8/1   24/12/3/1
             24/8/2   24/12/4/1
             24/8/4   24/12/4/2
             24/12/1  24/12/6/1
             24/12/2  24/12/6/2
             24/12/3  24/12/6/3
             24/12/4
             24/12/6

A325617 is the maximal case.
A337070 is the version for superprimorials.
A337074 counts the case with distinct prime multiplicities.
A337105 is the case ending with one.
A000005 counts divisors.
A000142 lists factorial numbers.
A027423 counts divisors of factorial numbers.
A067824 counts chains of divisors starting with n.
A074206 counts chains of divisors from n to 1.
A076716 counts factorizations of factorial numbers.
A253249 counts chains of divisors.
Cf. A001013, A001055, A002033, A022559, A124010, A167865, A336941, A336942.

chnsc[n_]:=Prepend[Join@@Table[Prepend[#,n]&/@chnsc[d],{d,Most[Divisors[n]]}],{n}];
Table[Length[chnsc[n!]],{n,0,5}]

a(n) = 2*A337105(n) for n > 1.

a(n) = A067824(n!).

a(19)-a(20) from Alois P. Heinz, Aug 23 2020

A337255 Irregular triangle read by rows where T(n,k) is the number of strict length-k chains of divisors starting with n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 2, 1, 1, 1, 3, 3, 1, 1, 2, 1, 1, 3, 2, 1, 1, 1, 5, 7, 3, 1, 1, 1, 3, 2, 1, 3, 2, 1, 4, 6, 4, 1, 1, 1, 1, 5, 7, 3, 1, 1, 1, 5, 7, 3, 1, 3, 2, 1, 3, 2, 1, 1, 1, 7, 15, 13, 4, 1, 2, 1, 1, 3, 2, 1, 3, 3, 1, 1, 5, 7, 3, 1, 1, 1

Offset: 1

Gus Wiseman, Aug 23 2020

			Sequence of rows begins:
     1: {1}           16: {1,4,6,4,1}
     2: {1,1}         17: {1,1}
     3: {1,1}         18: {1,5,7,3}
     4: {1,2,1}       19: {1,1}
     5: {1,1}         20: {1,5,7,3}
     6: {1,3,2}       21: {1,3,2}
     7: {1,1}         22: {1,3,2}
     8: {1,3,3,1}     23: {1,1}
     9: {1,2,1}       24: {1,7,15,13,4}
    10: {1,3,2}       25: {1,2,1}
    11: {1,1}         26: {1,3,2}
    12: {1,5,7,3}     27: {1,3,3,1}
    13: {1,1}         28: {1,5,7,3}
    14: {1,3,2}       29: {1,1}
    15: {1,3,2}       30: {1,7,12,6}
Row n = 24 counts the following chains:
  24  24/1   24/2/1   24/4/2/1   24/8/4/2/1
      24/2   24/3/1   24/6/2/1   24/12/4/2/1
      24/3   24/4/1   24/6/3/1   24/12/6/2/1
      24/4   24/4/2   24/8/2/1   24/12/6/3/1
      24/6   24/6/1   24/8/4/1
      24/8   24/6/2   24/8/4/2
      24/12  24/6/3   24/12/2/1
             24/8/1   24/12/3/1
             24/8/2   24/12/4/1
             24/8/4   24/12/4/2
             24/12/1  24/12/6/1
             24/12/2  24/12/6/2
             24/12/3  24/12/6/3
             24/12/4
             24/12/6

Alois P. Heinz, Rows n = 1..5000, flattened

A008480 gives rows ends.
A067824 gives row sums.
A073093 gives row lengths.
A334996 appears to be the case of chains ending with 1.
A337071 is the sum of row n!.
A000005 counts divisors.
A001055 counts factorizations.
A001222 counts prime factors with multiplicity.
A067824 counts chains of divisors starting with n.
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.
A251683 counts chains of divisors from n to 1 by length.
A253249 counts nonempty chains of divisors.
A337070 counts chains of divisors starting with A006939(n).
A337256 counts chains of divisors.
Cf. A001221, A002033, A124010, A124433, A337074, A337105, A337107.

b:= proc(n) option remember; expand(x*(1 +
      add(b(d), d=numtheory[divisors](n) minus {n})))
    end:
T:= n-> (p-> seq(coeff(p, x, i), i=1..degree(p)))(b(n)):
seq(T(n), n=1..50);  # Alois P. Heinz, Aug 23 2020

chss[n_]:=Prepend[Join@@Table[Prepend[#,n]&/@chss[d],{d,Most[Divisors[n]]}],{n}];
Table[Length[Select[chss[n],Length[#]==k&]],{n,30},{k,1+PrimeOmega[n]}]

A337107 Irregular triangle read by rows where T(n,k) is the number of strict length-k chains of divisors from n! to 1.

Original entry on oeis.org

1, 0, 1, 0, 1, 2, 0, 1, 6, 9, 4, 0, 1, 14, 45, 52, 20, 0, 1, 28, 183, 496, 655, 420, 105, 0, 1, 58, 633, 2716, 5755, 6450, 3675, 840, 0, 1, 94, 1659, 11996, 46235, 106806, 155869, 145384, 84276, 27720, 3960

Offset: 1

Gus Wiseman, Aug 23 2020

Row n > 1 appears to be row n! of A334996.

			Triangle begins:
    1
    0    1
    0    1    2
    0    1    6    9    4
    0    1   14   45   52   20
    0    1   28  183  496  655  420  105
    0    1   58  633 2716 5755 6450 3675  840
Row n = 4 counts the following chains:
  24/1  24/2/1   24/4/2/1   24/8/4/2/1
        24/3/1   24/6/2/1   24/12/4/2/1
        24/4/1   24/6/3/1   24/12/6/2/1
        24/6/1   24/8/2/1   24/12/6/3/1
        24/8/1   24/8/4/1
        24/12/1  24/12/2/1
                 24/12/3/1
                 24/12/4/1
                 24/12/6/1

A097805 is the restriction to powers of 2.
A325617 is the maximal case.
A337105 gives row sums.
A337106 is column k = 3.
A000005 counts divisors.
A000142 lists factorial numbers.
A001055 counts factorizations.
A074206 counts chains of divisors from n to 1.
A027423 counts divisors of factorial numbers.
A067824 counts chains of divisors starting with n.
A076716 counts factorizations of factorial numbers.
A253249 counts chains of divisors.
A337071 counts chains starting with n!.
Cf. A022559, A124010, A167865, A251683, A337070, A337074.

b:= proc(n) option remember; expand(x*(`if`(n=1, 1, 0) +
      add(b(d), d=numtheory[divisors](n) minus {n})))
    end:
T:= n-> (p-> seq(coeff(p, x, i), i=1..degree(p)))(b(n!)):
seq(T(n), n=1..10);  # Alois P. Heinz, Aug 23 2020

nv=5;
chnsc[n_]:=Select[Prepend[Join@@Table[Prepend[#,n]&/@chnsc[d],{d,DeleteCases[Divisors[n],n]}],{n}],MemberQ[#,1]&];
Table[Length[Select[chnsc[n!],Length[#]==k&]],{n,nv},{k,1+PrimeOmega[n!]}]

A343662 Irregular triangle read by rows where T(n,k) is the number of strict length k chains of divisors of n, 0 <= k <= Omega(n) + 1.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 2, 1, 1, 3, 3, 1, 1, 2, 1, 1, 4, 5, 2, 1, 2, 1, 1, 4, 6, 4, 1, 1, 3, 3, 1, 1, 4, 5, 2, 1, 2, 1, 1, 6, 12, 10, 3, 1, 2, 1, 1, 4, 5, 2, 1, 4, 5, 2, 1, 5, 10, 10, 5, 1, 1, 2, 1, 1, 6, 12, 10, 3, 1, 2, 1, 1, 6, 12, 10, 3, 1, 4, 5, 2, 1, 4, 5, 2

Offset: 1

Gus Wiseman, May 01 2021

			Triangle begins:
   1:  1  1
   2:  1  2  1
   3:  1  2  1
   4:  1  3  3  1
   5:  1  2  1
   6:  1  4  5  2
   7:  1  2  1
   8:  1  4  6  4  1
   9:  1  3  3  1
  10:  1  4  5  2
  11:  1  2  1
  12:  1  6 12 10  3
  13:  1  2  1
  14:  1  4  5  2
  15:  1  4  5  2
  16:  1  5 10 10  5  1
For example, row n = 12 counts the following chains:
  ()  (1)   (2/1)   (4/2/1)   (12/4/2/1)
      (2)   (3/1)   (6/2/1)   (12/6/2/1)
      (3)   (4/1)   (6/3/1)   (12/6/3/1)
      (4)   (4/2)   (12/2/1)
      (6)   (6/1)   (12/3/1)
      (12)  (6/2)   (12/4/1)
            (6/3)   (12/4/2)
            (12/1)  (12/6/1)
            (12/2)  (12/6/2)
            (12/3)  (12/6/3)
            (12/4)
            (12/6)

Column k = 1 is A000005.
Row ends are A008480.
Row lengths are A073093.
Column k = 2 is A238952.
The case from n to 1 is A334996 or A251683 (row sums: A074206).
A non-strict version is A334997 (transpose: A077592).
The case starting with n is A337255 (row sums: A067824).
Row sums are A337256 (nonempty: A253249).
A001055 counts factorizations.
A001221 counts distinct prime factors.
A001222 counts prime factors with multiplicity.
A097805 counts compositions by sum and length.
A122651 counts strict chains of divisors summing to n.
A146291 counts divisors of n with k prime factors (with multiplicity).
A163767 counts length n - 1 chains of divisors of n.
A167865 counts strict chains of divisors > 1 summing to n.
A337070 counts strict chains of divisors starting with superprimorials.
Cf. A002033, A007425, A007426, A051026, A062319, A143773, A186972, A327527, A337074, A337105, A337107, A343658.

Table[Length[Select[Reverse/@Subsets[Divisors[n],{k}],And@@Divisible@@@Partition[#,2,1]&]],{n,15},{k,0,PrimeOmega[n]+1}]

A337104 Number of strict chains of divisors from n! to 1 using terms of A130091 (numbers with distinct prime multiplicities).

Original entry on oeis.org

1, 1, 1, 0, 14, 0, 384, 0, 0, 0, 21077680, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

Offset: 0

Gus Wiseman, Aug 17 2020

nonn

The support appears to be {0, 1, 2, 4, 6, 10}.

			The a(4) = 14 chains:
  24/1
  24/2/1
  24/3/1
  24/4/1
  24/8/1
  24/12/1
  24/4/2/1
  24/8/2/1
  24/8/4/1
  24/12/2/1
  24/12/3/1
  24/12/4/1
  24/8/4/2/1
  24/12/4/2/1

A336867 appears to be the positions of zeros.
A336868 is the characteristic function (image under A057427).
A336942 is the version for superprimorials (n > 1).
A337105 does not require distinct prime multiplicities.
A337074 does not require chains to end with 1.
A337075 is the version for chains not containing n!.
A000005 counts divisors.
A000142 lists factorial numbers.
A001055 counts factorizations.
A027423 counts divisors of factorial numbers.
A067824 counts chains of divisors starting with n.
A074206 counts chains of divisors from n to 1.
A130091 lists numbers with distinct prime multiplicities.
A181796 counts divisors with distinct prime multiplicities.
A253249 counts chains of divisors.
A327498 gives the maximum divisor with distinct prime multiplicities.
A336414 counts divisors of n! with distinct prime multiplicities.
A336423 counts chains using A130091, with maximal case A336569.
A336425 counts divisible pairs of divisors of n!, both in A130091.
A336571 counts chains of divisors 1 < d < n using A130091.
A337071 counts chains of divisors starting with n!.
Cf. A002033, A022559, A071626, A098859, A124010, A167865, A327523, A336424, A336941.

strchns[n_]:=If[n==1,1,If[!UnsameQ@@Last/@FactorInteger[n],0,Sum[strchns[d],{d,Select[DeleteCases[Divisors[n],n],UnsameQ@@Last/@FactorInteger[#]&]}]]];
Table[strchns[n!],{n,0,8}]

a(n) = A337075(n) whenever A337075(n) != 0.
a(n) = A337074(n)/2 for n > 1.
a(n) = A336423(n!).

cp's OEIS Frontend

A067824 a(1) = 1; for n > 1, a(n) = 1 + Sum_{0 < d < n, d|n} a(d).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Formula

Extensions

A337105 Number of strict chains of divisors from n! to 1.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A337070 Number of strict chains of divisors starting with the superprimorial A006939(n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A337071 Number of strict chains of divisors starting with n!.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula

Extensions

A337255 Irregular triangle read by rows where T(n,k) is the number of strict length-k chains of divisors starting with n.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A337107 Irregular triangle read by rows where T(n,k) is the number of strict length-k chains of divisors from n! to 1.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

A343662 Irregular triangle read by rows where T(n,k) is the number of strict length k chains of divisors of n, 0 <= k <= Omega(n) + 1.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A337104 Number of strict chains of divisors from n! to 1 using terms of A130091 (numbers with distinct prime multiplicities).

Views

Author