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!)
A119791 a(1) = 1, a(n) = number of divisors of n*a(n-1). 4

%I #7 Sep 01 2016 03:52:30

%S 1,2,4,5,3,6,8,7,6,12,12,15,8,10,12,14,8,15,8,12,18,18,12,18,18,18,12,

%T 20,12,24,16,10,16,12,24,24,16,12,18,30,16,24,16,14,24,20,12,21,8,15,

%U 12,20,12,20,18,30,24,20,12,30,16,12,24,20,18,24,16,14,16,24,16,24,16,12

%N a(1) = 1, a(n) = number of divisors of n*a(n-1).

%C a(n)=A000005(n*a(n-1)) for n>1, a(1)=1;

%C see A119792 and A119793 for record values and where they occur: A119792(n)=a(A119793(n)).

%H Ivan Neretin, <a href="/A119791/b119791.txt">Table of n, a(n) for n = 1..10000</a>

%t Fold[Append[#1, DivisorSigma[0, #1[[-1]]*#2]] &, {1}, Range[2, 74]] (* _Ivan Neretin_, Sep 01 2016 *)

%K nonn

%O 1,2

%A _Reinhard Zumkeller_, May 24 2006

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 June 6 19:21 EDT 2024. Contains 373134 sequences. (Running on oeis4.)