A367170 - OEIS

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

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”).

Other ways to Give

A367170

The number of divisors of the largest unitary divisor of n that is a term of A138302.

1, 2, 2, 3, 2, 4, 2, 1, 3, 4, 2, 6, 2, 4, 4, 5, 2, 6, 2, 6, 4, 4, 2, 2, 3, 4, 1, 6, 2, 8, 2, 1, 4, 4, 4, 9, 2, 4, 4, 2, 2, 8, 2, 6, 6, 4, 2, 10, 3, 6, 4, 6, 2, 2, 4, 2, 4, 4, 2, 12, 2, 4, 6, 1, 4, 8, 2, 6, 4, 8, 2, 3, 2, 4, 6, 6, 4, 8, 2, 10, 5, 4, 2, 12, 4, 4

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

OFFSET

1,2

LINKS

Amiram Eldar, Table of n, a(n) for n = 1..10000

FORMULA

Multiplicative with a(p^e) = A048298(e) + 1.

a(n) = A000005(A367168(n)).

a(n) <= A000005(n), with equality if and only if n is in A138302.

MATHEMATICA

f[p_, e_] := If[e == 2^IntegerExponent[e, 2], e+1, 1]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]

PROG