OFFSET
1,6
COMMENTS
Although each path is self-avoiding, the different paths are allowed to intersect.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..500
Ivaylo Kortezov, Sets of Paths between Vertices of a Polygon, Mathematics Competitions, Vol. 35 (2022), No. 2, ISSN:1031-7503, pp. 35-43.
Index entries for linear recurrences with constant coefficients, signature (64,-1880,33600,-408316, 3571520,-23217064,114182720, -428394406,1227199680,-2668273640, 4345353664,-5182504636,4366326720, -2447285400,814968000,-121550625).
FORMULA
a(n) = (n*(n-1)*(n-2)/384)*(7^(n-3) - 3*5^(n-3) + 3^(n-2) - 1).
E.g.f.: x^3*exp(x)*(exp(2*x) - 1)^3/384. - Andrew Howroyd, Mar 07 2023
From Andrew Howroyd, Nov 23 2025: (Start)
Binomial transform of A359404.
G.f.: 3*x^6*(1 - 4*x)*(5 - 160*x + 2180*x^2 - 16480*x^3 + 75510*x^4 - 214880*x^5 + 372340*x^6 - 362400*x^7 + 153101*x^8)/((1 - x)^4*(1 - 3*x)^4*(1 - 5*x)^4*(1 - 7*x)^4). (End)
EXAMPLE
MATHEMATICA
A361284[n_] := n*(n-1)*(n-2)*(7^(n-3) - 3*5^(n-3) + 3^(n-2) - 1)/384;
Array[A361284, 25] (* Paolo Xausa, Jan 23 2026 *)
PROG
(PARI) a(n) = {(n*(n-1)*(n-2)/384) * (7^(n-3) - 3*5^(n-3) + 3^(n-2) - 1)} \\ Andrew Howroyd, Mar 07 2023
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Ivaylo Kortezov, Mar 07 2023
STATUS
approved
