The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A135937 a(1)=1; for n>=2, a(n) = Product_{d|a(n-1)} (d+1), where the product is over all positive divisors d of a(n-1). 1

%I #10 Mar 02 2023 12:45:32

%S 1,2,6,168,6623019333730800000

%N a(1)=1; for n>=2, a(n) = Product_{d|a(n-1)} (d+1), where the product is over all positive divisors d of a(n-1).

%C The next term is a lot bigger than 70000! and is too large to include. - _Stefan Steinerberger_, Dec 31 2007

%e The positive divisors of a(3)=6 are 1,2,3,6. So a(4) = (1+1)*(2+1)*(3+1)*(6+1) = 2*3*4*7 = 168.

%t a = {1}; Do[AppendTo[a, Times @@ (Divisors[a[[ -1]]] + 1)], {4}]; a (* _Stefan Steinerberger_, Dec 31 2007 *)

%Y Cf. A135938.

%K nonn

%O 1,2

%A _Leroy Quet_, Dec 07 2007

%E a(5) from _Stefan Steinerberger_, Dec 31 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 19 11:18 EDT 2024. Contains 372683 sequences. (Running on oeis4.)