The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A255433 a(n) = Product_{k=0..n} (k^3+1). 10
 1, 2, 18, 504, 32760, 4127760, 895723920, 308129028480, 158070191610240, 115391239875475200, 115506631115350675200, 153854832645647099366400, 266015005644323834804505600, 584700982406223788900303308800, 1605004196705084300531332582656000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS G. C. Greubel, Table of n, a(n) for n = 0..150 Erhan Gürela, Ali Ulas Özgür Kisisel, A note on the products (1^mu + 1)(2^mu + 1)···(n^mu + 1), Journal of Number Theory, Volume 130, Issue 1, January 2010, Pages 187-191. Chuan Ze Niu, (1^3+1)(2^3+1)...(n^3+1) is not a cube, arXiv:1612.08158 [math.NT], 2016. FORMULA a(n) ~ 2*sqrt(2*Pi) * cosh(sqrt(3)*Pi/2) * n^(3*n + 3/2) / exp(3*n). a(n) = 2*A158621(n). - Vaclav Kotesovec, Jul 11 2015 MATHEMATICA Table[Product[k^3 + 1, {k, 0, n}], {n, 0, 20}] FullSimplify[Table[(Cosh[Sqrt[3]*Pi/2] * Gamma[2+n] * Gamma[1/2 - I*Sqrt[3]/2 + n] * Gamma[1/2 + I*Sqrt[3]/2 + n])/Pi, {n, 0, 20}]] FoldList[Times, Range[0, 20]^3+1] (* Harvey P. Dale, Jul 07 2017 *) PROG (PARI) a(n) = prod(k=1, n, 1+k^3); \\ Michel Marcus, Jan 25 2016 CROSSREFS Cf. A101686, A158621, A255434, A255435. Sequence in context: A277037 A015203 A208885 * A121936 A063389 A188202 Adjacent sequences:  A255430 A255431 A255432 * A255434 A255435 A255436 KEYWORD nonn,easy AUTHOR Vaclav Kotesovec, Feb 23 2015 STATUS approved

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.

Last modified August 13 05:18 EDT 2022. Contains 356077 sequences. (Running on oeis4.)