login
A336939
Irregular triangle read by rows where T(n,k) is the number of divisors d of n! with k prime factors (counting multiplicity), such that both d and n!/d have distinct prime multiplicities.
2
1, 1, 1, 1, 0, 2, 0, 1, 2, 0, 2, 1, 0, 2, 0, 0, 2, 0, 1, 2, 1, 2, 2, 1, 2, 1, 0, 2, 0, 2, 0, 2, 0, 2, 0, 0, 2, 0, 4, 2, 2, 2, 2, 4, 0, 2, 0, 0, 2, 0, 4, 0, 4, 4, 4, 4, 0, 4, 0, 2, 0, 1, 3, 2, 6, 4, 5, 7, 6, 6, 7, 5, 4, 6, 2, 3, 1, 0, 2, 0, 4, 2, 2, 4, 4, 4, 4, 4, 2, 2, 4, 0, 2, 0
OFFSET
0,6
COMMENTS
A number has distinct prime multiplicities iff its prime signature is strict.
EXAMPLE
Triangle begins:
1
1
1 1
0 2 0
1 2 0 2 1
0 2 0 0 2 0
1 2 1 2 2 1 2 1
0 2 0 2 0 2 0 2 0
0 2 0 4 2 2 2 2 4 0 2 0
0 2 0 4 0 4 4 4 4 0 4 0 2 0
1 3 2 6 4 5 7 6 6 7 5 4 6 2 3 1
Row n = 8 counts the following divisors (empty columns shown as dots):
. 5 . 20 40 80 360 720 640 . 5760 .
7 28 56 112 504 1008 896 8064
45 1440
63 2016
MATHEMATICA
Table[Length[Select[Divisors[n!], UnsameQ@@Last/@FactorInteger[#]&&UnsameQ@@Last/@FactorInteger[n!/#]&&PrimeOmega[#]==k&]], {n, 0, 10}, {k, 0, PrimeOmega[n!]}]
CROSSREFS
A022559 gives row lengths minus one.
A336500 is the generalization to all positive integers.
A336868 gives the first (also last) column.
A336869 gives row sums.
A336870 is the version for superprimorials.
A000005 counts divisors.
A130091 lists numbers with distinct prime multiplicities.
A181796 counts divisors with distinct prime multiplicities.
A327498 gives the maximum divisor of n with distinct prime multiplicities.
A336414 counts divisors of factorials with distinct prime multiplicities.
A336415 counts divisors of factorials with equal prime multiplicities.
A336423 counts chains using A130091.
Sequence in context: A053603 A371222 A085794 * A239002 A004548 A125921
KEYWORD
nonn,tabf
AUTHOR
Gus Wiseman, Aug 08 2020
STATUS
approved