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!)
A324438 a(n) = Product_{i=1..n, j=1..n} (i^5 + j^5). 9

%I #21 Dec 08 2023 04:55:16

%S 1,2,139392,305013568273920000,

%T 1174837791623127613548781790822400000000,

%U 139642003782073074626249921818187528362524804267528306032640000000000000

%N a(n) = Product_{i=1..n, j=1..n} (i^5 + j^5).

%F a(n) ~ c * 2^(2*n*(n+1)) * phi^(sqrt(5)*n*(n+1)) * exp(Pi*sqrt(phi)*n*(n+1)/5^(1/4) - 15*n^2/2) * n^(5*n^2 - 5/4), where phi = A001622 = (1+sqrt(5))/2 is the golden ratio and c = 0.1574073828647726237455544898360432469056972905505624900871695...

%F a(n) = A367679(n) * A079478(n). - _Vaclav Kotesovec_, Nov 26 2023

%F For n>0, a(n)/a(n-1) = A272248(n)^2 / (2*n^15). - _Vaclav Kotesovec_, Dec 02 2023

%p a:= n-> mul(mul(i^5 + j^5, i=1..n), j=1..n):

%p seq(a(n), n=0..5); # _Alois P. Heinz_, Nov 26 2023

%t Table[Product[i^5 + j^5, {i, 1, n}, {j, 1, n}], {n, 1, 6}]

%o (Python)

%o from math import prod, factorial

%o def A324438(n): return prod(i**5+j**5 for i in range(1,n) for j in range(i+1,n+1))**2*factorial(n)**5<<n # _Chai Wah Wu_, Nov 26 2023

%Y Cf. A079478, A324403, A324426, A324437, A324439, A324440, A367834.

%Y Cf. A272248, A367679.

%K nonn

%O 0,2

%A _Vaclav Kotesovec_, Feb 28 2019

%E a(0)=1 prepended by _Alois P. Heinz_, Nov 26 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 July 30 02:35 EDT 2024. Contains 374734 sequences. (Running on oeis4.)