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.

A329024 Constant term in the expansion of ((x^3 + x + 1/x + 1/x^3)*(y^3 + y + 1/y + 1/y^3) - (x + 1/x)*(y + 1/y))^(2*n).

Original entry on oeis.org

1, 12, 588, 49440, 5187980, 597027312, 71962945824, 8923789535232, 1128795397492620, 144940851928720848, 18832163401980525168, 2470451402766989534256, 326667449725835512275488, 43485599433527022301377600, 5821983056232777427055717760
Offset: 0

Views

Author

Seiichi Manyama, Nov 02 2019

Keywords

Comments

Also number of (2*n)-step closed paths (from origin to origin) in 2-dimensional lattice, using steps (t_1,t_2) (|t_1| + |t_2| = 3).
*
|
*-- --*
| | |
*-- -- -- --*
| | | | |
*-- -- --P-- -- --*
| | | | |
*-- -- -- --*
| | |
*-- --*
|
*
Point P move to any position of * in the next step.

Crossrefs

Row n=1 of A329066.

Programs

  • PARI
    {a(n) = polcoef(polcoef(((x^3+x+1/x+1/x^3)*(y^3+y+1/y+1/y^3)-(x+1/x)*(y+1/y))^(2*n), 0), 0)}
    
  • PARI
    {a(n) = polcoef(polcoef((sum(k=0, 3, (x^k+1/x^k)*(y^(3-k)+1/y^(3-k)))-x^3-1/x^3-y^3-1/y^3)^(2*n), 0), 0)}
    
  • PARI
    f(n) = (x^(2*n+2)-1/x^(2*n+2))/(x-1/x);
    a(n) = sum(k=0, 2*n, (-1)^k*binomial(2*n, k)*polcoef(f(1)^k*f(0)^(2*n-k), 0)^2)

Formula

Conjecture: a(n) ~ 3 * 144^n / (19*Pi*n). - Vaclav Kotesovec, Nov 04 2019