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

A062962
Number of divisors of n-th term of sequence a(n+1) = a(n)*(a(0) + ... + a(n)) (A001697).
0
1, 1, 2, 4, 12, 40, 160, 792, 9408, 783360, 55987200, 35610624000, 269007298560000
OFFSET
0,3
FORMULA
a(n) = A000005(A001697(n)). - Amiram Eldar, Feb 17 2019
MATHEMATICA
a[0] = 1; a[1] = 1; a[n_] := a[n] = a[n - 1]^2*(1 + 1/a[n - 2]); Table[DivisorSigma[0, a[n]], {n, 0, 10}] (* Amiram Eldar, Feb 17 2019 after Jean-François Alcover at A001697 *)
PROG
(PARI) a(n)=if(n<2, n >= 0, a(n-1)^2*(1+1/a(n-2)));
for(n=0, 11, print1(numdiv(a(n)), ", "))
CROSSREFS
Sequence in context: A215074 A215070 A188479 * A033472 A134983 A330679
KEYWORD
nonn,hard,more
AUTHOR
Jason Earls, Jul 22 2001
EXTENSIONS
a(11) from Amiram Eldar, Feb 17 2019
a(12) from Max Alekseyev, Feb 20 2024
STATUS
approved