OFFSET
3,1
COMMENTS
Mutual-visibility sets in the n-prism graph have at most 6 vertices. - Andrew Howroyd, Jan 11 2026
LINKS
Andrew Howroyd, Table of n, a(n) for n = 3..1000
Andrew Howroyd, Visibility polynomial is the n-prism graph, Feb 2026.
Eric Weisstein's World of Mathematics, Prism Graph.
Eric Weisstein's World of Mathematics, Visibility Polynomial.
Index entries for linear recurrences with constant coefficients, signature (1,6,-6,-15,15,20,-20,-15,15,6,-6,-1,1).
FORMULA
From Andrew Howroyd, Jan 11 2026: (Start)
a(n) = (7*n^6 + 135*n^5 + 730*n^4 + 11370*n^3 - 43937*n^2 + 83535*n + 5760)/5760 for odd n >= 7.
a(n) = (7*n^6 + 210*n^5 + 1660*n^4 + 14040*n^3 - 117632*n^2 + 384000*n + 5760)/5760 for even n >= 10.
G.f.: x^3*(54 + 127*x - 194*x^2 - 181*x^3 + 385*x^4 + 325*x^5 - 599*x^6 - 269*x^7 + 411*x^8 + 24*x^9 + 65*x^10 + 132*x^11 - 276*x^12 - 136*x^13 + 198*x^14 + 72*x^15 - 82*x^16 - 16*x^17 + 16*x^18)/((1 - x)^7*(1 + x)^6). (End)
PROG
(PARI) a(n) = if(n<9, [8, -32, 10, -14, 0, -16][n-2]) + if(n%2, 7*n^6 + 135*n^5 + 730*n^4 + 11370*n^3 - 43937*n^2 + 83535*n + 5760, 7*n^6 + 210*n^5 + 1660*n^4 + 14040*n^3 - 117632*n^2 + 384000*n + 5760)/(5760) \\ Andrew Howroyd, Jan 11 2026
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Eric W. Weisstein, Sep 25 2025
EXTENSIONS
a(27) onward from Andrew Howroyd, Jan 11 2026
STATUS
approved
