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!)
A324439 a(n) = Product_{i=1..n, j=1..n} (i^6 + j^6). 8
1, 2, 1081600, 528465082730906880000, 29276520893554373473343522853366005760000000000, 5719545329208791496596894540018824083491259163047733746620041978183680000000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) ~ c * 2^(n*(n+1)) * (2 + sqrt(3))^(sqrt(3)*n*(n+1)) * exp(Pi*n*(n+1) - 9*n^2) * n^(6*n^2 - 3/2), where c = 0.104143806044091748191387307161835081649...
a(n) = A324403(n) * A367668(n). - Vaclav Kotesovec, Dec 01 2023
For n>0, a(n)/a(n-1) = A367823^2 / (2*n^18). - Vaclav Kotesovec, Dec 02 2023
MAPLE
a:= n-> mul(mul(i^6 + j^6, i=1..n), j=1..n):
seq(a(n), n=0..5); # Alois P. Heinz, Nov 26 2023
MATHEMATICA
Table[Product[i^6 + j^6, {i, 1, n}, {j, 1, n}], {n, 1, 6}]
PROG
(Python)
from math import prod, factorial
def A324439(n): return (prod(i**6+j**6 for i in range(1, n) for j in range(i+1, n+1))*factorial(n)**3)**2<<n # Chai Wah Wu, Nov 26 2023
CROSSREFS
Sequence in context: A052205 A170996 A051118 * A218169 A168535 A303433
KEYWORD
nonn
AUTHOR
Vaclav Kotesovec, Feb 28 2019
EXTENSIONS
a(n)=1 prepended by Alois P. Heinz, Nov 26 2023
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 00:45 EDT 2024. Contains 371696 sequences. (Running on oeis4.)