A070190 -id:A070190 - cp's OEIS frontend

A198800 Number of closed paths of length n whose steps are 20th roots of unity, U_20(n).

1, 0, 20, 0, 1140, 480, 102800, 151200, 12310900, 38707200, 1812247920, 9574488000, 313983978000, 2391608419200, 62051403928800, 611744666332800, 13627749414064500, 160896284989440000, 3253345101771050000, 43527416858084016000, 829176006298475046640

Offset: 0

Simon Plouffe, Oct 30 2011

nonn

U_20(n) (comment in article) : For each m >= 1, the sequence (U_m(N)), N >= 0 is P-recursive but is not algebraic when m > 2.

Andrew Howroyd, Table of n, a(n) for n = 0..200
Gilbert Labelle and Annie Lacasse, Closed paths whose steps are roots of unity, in FPSAC 2011, Reykjavik, Iceland DMTCS proc. AO, 2011, 599-610.

Cf. A070190, A198808.

seq(n)={Vec(serlaplace(sum(k=0, n, if(k,2,1)*(x^k*besseli(k, 2*x + O(x^(n-k+1)))/k!)^5)^2))} \\ Andrew Howroyd, Nov 01 2018

E.g.f.: g(x)^2 where g(x) is the e.g.f. of A070190. - Andrew Howroyd, Nov 01 2018

a(n) ~ 2^(2*n) * 5^(n+3) / (Pi^4 * n^4). - Vaclav Kotesovec, Apr 30 2024

A321416 Number of n element multisets of the 10th roots of unity with zero sum.

Original entry on oeis.org

1, 0, 5, 0, 15, 2, 35, 10, 70, 30, 128, 70, 220, 140, 360, 254, 565, 430, 855, 690, 1255, 1060, 1795, 1570, 2510, 2256, 3440, 3160, 4630, 4330, 6132, 5820, 8005, 7690, 10315, 10008, 13135, 12850, 16545, 16300, 20634, 20450, 25500, 25400, 31250, 31260

Offset: 0

Andrew Howroyd, Nov 09 2018

Equivalently, the number of closed convex paths of length n whose steps are the 10th roots of unity up to translation. For even n, there will be 5 paths of zero area consisting of n/2 steps in one direction followed by n/2 steps in the opposite direction.

Andrew Howroyd, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (1,4,-4,-6,7,3,-8,3,7,-6,-4,4,1,-1)

Column k=5 of A321414.

Cf. A053090, A070190.

LinearRecurrence[{1, 4, -4, -6, 7, 3, -8, 3, 7, -6, -4, 4, 1, -1},{1, 0, 5, 0, 15, 2, 35, 10, 70, 30, 128, 70, 220, 140}, 50] (* Jinyuan Wang, Feb 28 2020 *)

Vec((1 - x^10)/((1 - x^2)^5 * (1 - x^5)^2) + O(x^50))

G.f.: (1 - x^10)/((1 - x^2)^5 * (1 - x^5)^2).

G.f.: (1 - x + x^2 - x^3 + x^4)/((1 + x + x^2 + x^3 + x^4)*(1 - x)^6*(1 + x)^4).

A198806 Number of closed paths of length n whose steps are 14th roots of unity, U_14(n).

Original entry on oeis.org

1, 0, 14, 0, 546, 0, 32900, 10080, 2570050, 2540160, 238935564, 465696000, 25142196156, 76886409600, 2900343069624, 12211317518400, 359067702643650, 1915829643087360, 47006105030584700, 300455419743198720, 6437718469449262996

Offset: 0

Simon Plouffe, Oct 30 2011

nonn

U_14(n), (comment in article): For each m >= 1, the sequence (U_m(N)), N >= 0 is P-recursive but is not algebraic when m > 2.

Andrew Howroyd, Table of n, a(n) for n = 0..200
Gilbert Labelle and Annie Lacasse, Closed paths whose steps are roots of unity, in FPSAC 2011, Reykjavik, Iceland DMTCS proc. AO, 2011, 599-610.

Cf. A002898, A070190, A071549.

seq(n)={Vec(serlaplace(sum(k=0, n, if(k,2,1)*(x^k*besseli(k, 2*x + O(x^(n-k+1)))/k!)^7)))} \\ Andrew Howroyd, Nov 01 2018

E.g.f.: BesselI(0,2*x)^7 + 2*Sum_{k>=1} BesselI(k,2*x)^7. - Andrew Howroyd, Nov 01 2018

cp's OEIS Frontend

A198800 Number of closed paths of length n whose steps are 20th roots of unity, U_20(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

A321416 Number of n element multisets of the 10th roots of unity with zero sum.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A198806 Number of closed paths of length n whose steps are 14th roots of unity, U_14(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula