STATUS
reviewed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A260619
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
STATUS
proposed
reviewed
STATUS
editing
proposed
PROG
(Python 3.8+)
STATUS
proposed
editing
STATUS
editing
proposed
PROG
return sum(s*e//p for p, e in sum(((lambda x: Counter({k:x[k]*m for k in x}))(factorint(m)) for m in range(2, n+1)), start=Counter({2:0})).items()) if n > 1 else 0 # Chai Wah Wu, Jun 12 2022
PROG
(Python)
from math import prod
from collections import Counter
from sympy import factorint
def A260619(n):
s = prod(i**i for i in range(2, n+1))
return sum(s*e//p for p, e in sum(((lambda x: Counter({k:x[k]*m for k in x}))(factorint(m)) for m in range(2, n+1)), start=Counter({2:0})).items()) if n > 1 else 0 # Chai Wah Wu, Jun 12 2022
STATUS
approved
editing
STATUS
reviewed
approved
STATUS
proposed
reviewed
STATUS
editing
proposed