|
|
|
|
0, 2, 4, 6, 6, 9, 8, 12, 12, 12, 10, 16, 12, 15, 15, 20, 14, 20, 16, 20, 18, 18, 18, 25, 18, 21, 24, 24, 20, 24, 22, 30, 21, 24, 21, 30, 24, 27, 24, 30, 26, 28, 28, 28, 28, 30, 30, 36, 24, 28, 27, 32, 32, 35, 24, 35, 30, 33, 34, 35, 36, 36, 32, 42, 27, 32, 38
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
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
|
|
|
FORMULA
|
a(n) = (k + 1) * m, where m and k are the sum and length of the integer partition with Heinz number n.
|
|
MATHEMATICA
|
primeMS[n_]:=If[n==1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];
Table[(PrimeOmega[n]+1)*Total[primeMS[n]], {n, 30}]
|
|
PROG
|
(Python)
from sympy import primepi, factorint
def A359362(n): return (sum((f:=factorint(n)).values())+1)*sum(primepi(p)*e for p, e in f.items()) # Chai Wah Wu, Jan 01 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|