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!)
A329077 Constant term in the expansion of ((Sum_{k=-3..3} x^k) * (Sum_{k=-3..3} y^k) - (Sum_{k=-2..2} x^k) * (Sum_{k=-2..2} y^k))^n. 2
1, 0, 24, 72, 3336, 34800, 912840, 15661520, 355423880, 7241240160, 160151370624, 3461028611040, 76789098028104, 1700195813892576, 38037857914721808, 853169553940415712, 19240825799184080520, 435267116844063531456, 9882232970998312871232 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Also number of n-step closed paths (from origin to origin) in 2-dimensional lattice, using steps (t_1,t_2) (|t_1| + |t_2| = 6).
LINKS
Seiichi Manyama, Table of n, a(n) for n = 0..500 (terms 0..230 from Vaclav Kotesovec)
Wikipedia, Taxicab geometry.
FORMULA
Conjecture: a(n) ~ 6 * 24^n / (73*Pi*n). - Vaclav Kotesovec, Nov 04 2019
PROG
(PARI) {a(n) = polcoef(polcoef((sum(k=-3, 3, x^k)*sum(k=-3, 3, y^k)-sum(k=-2, 2, x^k)*sum(k=-2, 2, y^k))^n, 0), 0)}
(PARI) {a(n) = polcoef(polcoef((sum(k=0, 6, (x^k+1/x^k)*(y^(6-k)+1/y^(6-k)))-x^6-1/x^6-y^6-1/y^6)^n, 0), 0)}
(PARI) f(n) = (x^(n+1)-1/x^n)/(x-1);
a(n) = sum(k=0, n, (-1)^(n-k)*binomial(n, k)*polcoef(f(3)^k*f(2)^(n-k), 0)^2)
CROSSREFS
Row n=3 of A329074.
Sequence in context: A192833 A292353 A189540 * A339883 A042128 A043406
KEYWORD
nonn,walk
AUTHOR
Seiichi Manyama, Nov 04 2019
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 July 29 21:21 EDT 2024. Contains 374734 sequences. (Running on oeis4.)