login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A321144
Irregular triangle where T(n,k) is the number of divisors of n whose prime indices sum to k.
3
1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 2, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0
OFFSET
1,45
COMMENTS
The rows are all palindromes.
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
EXAMPLE
Triangle begins:
1
1 1
1 0 1
1 1 1
1 0 0 1
1 1 1 1
1 0 0 0 1
1 1 1 1
1 0 1 0 1
1 1 0 1 1
1 0 0 0 0 1
1 1 2 1 1
1 0 0 0 0 0 1
1 1 0 0 1 1
1 0 1 1 0 1
1 1 1 1 1
1 0 0 0 0 0 0 1
1 1 1 1 1 1
1 0 0 0 0 0 0 0 1
1 1 1 1 1 1
1 0 1 0 1 0 1
1 1 0 0 0 1 1
1 0 0 0 0 0 0 0 0 1
1 1 2 2 1 1
1 0 0 1 0 0 1
1 1 0 0 0 0 1 1
1 0 1 0 1 0 1
1 1 1 0 1 1 1
1 0 0 0 0 0 0 0 0 0 1
1 1 1 2 1 1 1
MATHEMATICA
primeMS[n_]:=If[n==1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]]
Table[Count[Total/@primeMS/@Divisors[n], k], {n, 20}, {k, 0, Total[primeMS[n]]}]
CROSSREFS
Row lengths are A056239. Number of nonzero entries in row n is A299701(n).
Sequence in context: A377080 A316867 A127327 * A309048 A379666 A086072
KEYWORD
nonn,tabf
AUTHOR
Gus Wiseman, Oct 28 2018
STATUS
approved