OFFSET
3,1
COMMENTS
For n >= 7, the visibility polynomial is (1 + x)^(2*n) + x + 2*n*x^2*(1 + 2*x). - Andrew Howroyd, Dec 27 2025
LINKS
Andrew Howroyd, Table of n, a(n) for n = 3..1000
Andrew Howroyd, Visibility polynomial of cone graphs, Jan 2026.
Eric Weisstein's World of Mathematics, Double Cone Graph.
Eric Weisstein's World of Mathematics, Visibility Polynomial.
Index entries for linear recurrences with constant coefficients, signature (6,-9,4).
FORMULA
From Andrew Howroyd, Dec 27 2025: (Start)
a(n) = 4^n + 6*n + 1 for n >= 7.
G.f.: x^3*(79 - 189*x + 66*x^2 - 4*x^3 + 50*x^4 - 4*x^5 - 16*x^6)/((1 - x)^2*(1 - 4*x)). (End)
MATHEMATICA
Table[Piecewise[{{79, n == 3}, {285, n == 4}, {1065, n == 5}, {4137, n == 6}}, 1 + 4^n + 6 n], {n, 3, 20}] (* Eric W. Weisstein, Feb 16 2026 *)
Join[{79, 285, 1065, 4137}, LinearRecurrence[{6, -9, 4}, {16427, 65585, 262199}, 20]] (* Eric W. Weisstein, Feb 16 2026 *)
CoefficientList[Series[(-79 + 189 x - 66 x^2 + 4 x^3 - 50 x^4 + 4 x^5 + 16 x^6)/((-1 + x)^2 (-1 + 4 x)), {x, 0, 20}], x] (* Eric W. Weisstein, Feb 16 2026 *)
PROG
(PARI) a(n) = if(n<7, [79, 285, 1065, 4137][n-2], 4^n + 6*n + 1) \\ Andrew Howroyd, Dec 27 2025
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Eric W. Weisstein, Sep 26 2025
EXTENSIONS
a(12) onward from Andrew Howroyd, Dec 27 2025
STATUS
approved
