login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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.
LINKS
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: A330985 A316867 A127327 * A309048 A086072 A086009
KEYWORD
nonn,tabf
AUTHOR
Gus Wiseman, Oct 28 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 04:14 EDT 2024. Contains 371918 sequences. (Running on oeis4.)