cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A340182 a(n) = Product_{1<=j,k,m<=n} (4*cos(j*Pi/(2*n+1))^2 + 4*cos(k*Pi/(2*n+1))^2 + 4*cos(m*Pi/(2*n+1))^2).

Original entry on oeis.org

1, 3, 61731, 220157391087140625, 3109768877542258728107559478225309328087616
Offset: 0

Views

Author

Seiichi Manyama, Dec 31 2020

Keywords

Comments

(a(n)/3^n)^(1/3) is an integer.

Crossrefs

Cf. A004003, A071763, A340181, A340183.

Programs

  • Mathematica
    Round[Table[4^(n^3) * Product[Cos[j*Pi/(2*n + 1)]^2 + Cos[k*Pi/(2*n + 1)]^2 + Cos[m*Pi/(2*n + 1)]^2, {j, 1, n}, {k, 1, n}, {m, 1, n}], {n, 0, 5}]] (* or *)
Round[Table[2^(n^3) * Product[3 + Cos[2*j*Pi/(2*n + 1)] + Cos[2*k*Pi/(2*n + 1)] + Cos[2*m*Pi/(2*n + 1)], {j, 1, n}, {k, 1, n}, {m, 1, n}], {n, 0, 5}]] (* or *)
Round[Table[Product[u = Sqrt[Cos[j*Pi/(2*n + 1)]^2 + Cos[k*Pi/(2*n + 1)]^2]; (((u + Sqrt[1 + u^2])^(2*n + 1) - (u - Sqrt[1 + u^2])^(2*n + 1))/(2*Sqrt[1 + u^2])), {j, 1, n}, {k, 1, n}], {n, 0, 5}]] (* Vaclav Kotesovec, Jan 04 2021 *)
  • PARI
    default(realprecision, 500);
{a(n) = round(prod(j=1, n, prod(k=1, n, prod(m=1, n, 4*cos(j*Pi/(2*n+1))^2+4*cos(k*Pi/(2*n+1))^2+4*cos(m*Pi/(2*n+1))^2))))}

Formula

From Vaclav Kotesovec, Jan 04 2021: (Start)
a(n) ~ c * d^n * s^(n^2) * r^(n^3), where
r = exp(8*A340322/Pi^3) = exp((8/Pi^3) * Integral_{x=0..Pi/2, y=0..Pi/2, z=0..Pi/2} log(4*cos(x)^2 + 4*cos(y)^2 + 4*cos(z)^2) dx dy dz) = 5.3302028892051674211345979966496595201084467305922855029660919024805225841...
s = 0.57208914727550556482486188829703578692890272003698306852389010626941042...
d = 0.91012013388841787275362130594290903074302493828277326742531159...
c = 1.057086458532774496412062406469810663638243576302292119... (End)

A340181 a(n) = Product_{1<=j,k,m<=n} (4*sin(j*Pi/(2*n+1))^2 + 4*sin(k*Pi/(2*n+1))^2 + 4*sin(m*Pi/(2*n+1))^2).

Original entry on oeis.org

1, 9, 7486875, 14334918272193811385583, 1483160703050490588200236172057973908184332257091136
Offset: 0

Views

Author

Seiichi Manyama, Dec 31 2020

Keywords

Comments

(a(n)/((2n + 1)*3^n))^(1/3) is an integer.

Crossrefs

Cf. A124647, A127605, A340182, A340183.

Programs

  • Mathematica
    Round[Table[2^(n^3)* Product[3 - Cos[2*j*Pi/(2*n + 1)] - Cos[2*k*Pi/(2*n + 1)] - Cos[2*m*Pi/(2*n + 1)], {j, 1, n}, {k, 1, n}, {m, 1, n}], {n, 0, 5}]] (* Vaclav Kotesovec, Jan 04 2021 *)
  • PARI
    default(realprecision, 500);
{a(n) = round(prod(j=1, n, prod(k=1, n, prod(m=1, n, 4*sin(j*Pi/(2*n+1))^2+4*sin(k*Pi/(2*n+1))^2+4*sin(m*Pi/(2*n+1))^2))))}

Formula

Limit_{n->infinity} a(n)^(1/n^3) = exp(8*A340322/Pi^3). - Vaclav Kotesovec, Jan 05 2021

A340396 a(n) = 2^(n^2 - 1) * Product_{j=1..n, k=1..n} (1 + sin(Pi*j/n)^2 + sin(Pi*k/n)^2).

Original entry on oeis.org

0, 1, 96, 93789, 1244160000, 241885578271872, 700566272328037500000, 30323548995402141685610526683, 19627362048402730985830806120284160000, 189995156103157091521654945902925881881155376920, 27506190205802587152768139358989866456457087869970721213256
Offset: 0

Views

Author

Vaclav Kotesovec, Jan 06 2021

Keywords

Crossrefs

Cf. A004003, A007726, A065072, A067518, A127605, A340052, A340165, A340182, A340183, A340293.

Programs

  • Mathematica
    Table[2^(n^2 - 1) * Product[1 + Sin[Pi*j/n]^2 + Sin[Pi*k/n]^2, {j, 1, n}, {k, 1, n}], {n, 0, 10}] // Round

Formula

a(n) = 2^(n^2-1) * Product_{j=1..n, k=1..n} (3 - cos(Pi*j/n)^2 - cos(Pi*k/n)^2).
a(n) = 2^(n^2-1) * Product_{j=1..n, k=1..n} (2-cos(2*Pi*j/n)/2-cos(2*Pi*k/n)/2).
a(n) ~ 2^(n^2-1) * exp(4*c*n^2/Pi^2), where c = Integral_{x=0..Pi/2, y=0..Pi/2} log(1 + sin(x)^2 + sin(y)^2) dy dx = -Pi^2*(log(2) + log(sqrt(2)-1)/2) + Pi * Integral_{x=0..Pi/2} log(1 + sqrt(1 + 1/(1 + sin(x)^2))) dx = A340421 = 1.627008991085721315763766677017604437985734719035793082916212355323520649...
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.