login

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

A366808
The number of divisors of prime(n)#-1 where p# is the product of all the primes from 2 to p inclusive.
1
1, 2, 2, 4, 2, 2, 4, 8, 8, 4, 4, 16, 2, 4, 8, 8, 4, 8, 8, 4, 4, 16, 8, 2, 4, 4, 16, 16, 16, 8, 8, 8, 8, 8, 8, 16, 16, 16, 32, 8, 32, 16, 32, 16, 16, 16, 16, 4, 8, 8, 4, 16, 8, 16, 4, 16, 16, 128, 16, 8, 8, 16, 16, 8, 8, 2, 8, 2, 16, 8, 32, 32, 16, 16, 64, 32
OFFSET
1,2
FORMULA
a(n) = sigma0(prime(n)#-1) = A000005(A057588(n)).
EXAMPLE
a(4)=4 because the divisors of 7#-1 = 209 are {1, 11, 19, 209}.
MAPLE
seq(numtheory[tau](mul(ithprime(k), k=1..n)-1), n=1..30);
MATHEMATICA
Map[DivisorSigma[0, #] &, -1 + FoldList[Times, Prime@ Range@ 30] ] (* Michael De Vlieger, Oct 25 2023 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Sean A. Irvine, Oct 23 2023
STATUS
approved