A104369 - 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

A104369

Number of divisors of A104365(n) = A104350(n) + 1.

2, 2, 2, 2, 2, 2, 4, 2, 2, 4, 2, 2, 4, 4, 4, 16, 16, 4, 2, 16, 4, 4, 8, 4, 2, 16, 8, 8, 2, 8, 16, 32, 16, 32, 16, 8, 8, 16, 128, 4, 32, 16, 16, 4, 16, 8, 16, 4, 8, 128, 16, 4, 16, 4, 8, 4, 16, 8, 16, 32, 8, 16, 16, 4, 2, 4, 16, 64, 16, 8, 8, 16, 16, 64, 64, 64, 32, 8, 64, 16, 32, 8, 8, 32, 8, 16, 8, 16, 128, 64, 16, 8, 16, 4, 8

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

OFFSET

1,1

LINKS

Max Alekseyev, Table of n, a(n) for n = 1..158 (terms 142..151 from Tyler Busby)

Reinhard Zumkeller, Products of largest prime factors of numbers <= n

FORMULA

a(n) = A000005(A104365(n)).

MATHEMATICA

a[n_] := DivisorSigma[0, 1 + Product[FactorInteger[k][[-1, 1]], {k, 1, n}]]; Array[a, 76] (* Amiram Eldar, Feb 12 2020 *)

CROSSREFS