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!)
A066843 a(n) = Product_{k=1..n} d(k); d(k) = A000005(k) is the number of positive divisors of k. 18

%I #55 Jul 19 2023 09:35:42

%S 1,1,2,4,12,24,96,192,768,2304,9216,18432,110592,221184,884736,

%T 3538944,17694720,35389440,212336640,424673280,2548039680,10192158720,

%U 40768634880,81537269760,652298158080,1956894474240,7827577896960,31310311587840,187861869527040

%N a(n) = Product_{k=1..n} d(k); d(k) = A000005(k) is the number of positive divisors of k.

%C a(n) is also the determinant of the symmetric n X n matrix M defined by M(i,j) = d_3(gcd(i,j)) for 1 <= i,j <= n, where d_3(n) is A007425. - _Enrique Pérez Herrero_, Aug 12 2011

%C a(n) is the number of integer sequences of length n where a(m) divides m for every term. - _Franklin T. Adams-Watters_, Oct 29 2017

%H Alois P. Heinz, <a href="/A066843/b066843.txt">Table of n, a(n) for n = 0..1310</a> (terms n = 1..200 from Harry J. Smith)

%H Antal Bege, <a href="http://www.emis.de/journals/AUSM/C1-1/MATH1-4.PDF">Hadamard product of GCD matrices</a>, Acta Univ. Sapientiae, Mathematica, 1, 1 (2009) 43-49

%H Mathoverflow, <a href="https://mathoverflow.net/questions/208827/product-of-tauk">Product of tau(k)</a>, 2015.

%H Ramanujan's Papers, <a href="https://web.archive.org/web/20200124035942/http://ramanujan.sirinudi.org/Volumes/published/ram17.html">Some formulas in the analytic theory of numbers</a>, Messenger of Mathematics, XLV, 1916, 81-84, Formula (10).

%F a(n) = product{p=primes<=n} product{1<=k<=log(n)/log(p)} (1 +1/k)^floor(n/p^k). - _Leroy Quet_, Mar 20 2007

%p with(numtheory):seq(mul(tau(k),k=1..n), n=0..26); # _Zerinvary Lajos_, Jan 11 2009

%p with(numtheory):a[0]:=1: for n from 2 to 26 do a[n]:=a[n-1]*tau(n) od: seq(a[n], n=0..26); # _Zerinvary Lajos_, Mar 21 2009

%t A066843[n_] := Product[DivisorSigma[0,i], {i,1,n}]; Array[A066843,20] (* _Enrique Pérez Herrero_, Aug 12 2011 *)

%t FoldList[Times, Array[DivisorSigma[0, #] &, 27]] (* _Michael De Vlieger_, Nov 01 2017 *)

%o (PARI) { p=1; for (n=1, 200, p*=length(divisors(n)); write("b066843.txt", n, " ", p) ) } \\ _Harry J. Smith_, Apr 01 2010

%Y Cf. A000005, A001088, A066780.

%K nonn

%O 0,3

%A _Leroy Quet_, Jan 20 2002

%E a(0)=1 prepended by _Alois P. Heinz_, Jul 19 2023

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 April 24 10:11 EDT 2024. Contains 371935 sequences. (Running on oeis4.)