A329043 - OEIS

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

A329043

a(n) = Product_{d|A122111(n), d>1} A008578(1+A286561(n,d)), where A286561(n,d) gives the exponent of the highest power of d dividing n.

1, 2, 1, 1, 1, 8, 1, 1, 6, 2, 1, 3, 1, 2, 2, 1, 1, 3, 1, 48, 2, 2, 1, 5, 1, 2, 1, 6, 1, 128, 1, 1, 2, 2, 1, 3, 1, 2, 2, 10, 1, 8, 1, 6, 2, 2, 1, 7, 1, 3, 2, 6, 1, 1, 1, 320, 2, 2, 1, 12, 1, 2, 1, 1, 1, 8, 1, 6, 2, 8, 1, 3, 1, 2, 48, 6, 1, 8, 1, 21, 1, 2, 1, 3072, 1, 2, 2, 20, 1, 8, 1, 6, 2, 2, 1, 11, 1, 1, 1, 1, 1, 8, 1, 20, 8

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..10000

Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537

Index entries for sequences computed from indices in prime factorization

FORMULA

a(n) = Product_{d|A122111(n), d>1} A008578(1+A286561(n,d)).

1+A001222(a(n)) = A329036(n).

PROG

(PARI)