OFFSET
1,3
COMMENTS
Number of minimum distinguishing (2-)labelings of the n-pan graph for n >= 3.
LINKS
Muniru A Asiru, Table of n, a(n) for n = 1..500
J. Tymoczko, Distinguishing numbers for graphs and groups, arXiv:math/0406542 [math.CO], 2004-2005.
Eric Weisstein's World of Mathematics, Distinguishing Number.
Eric Weisstein's World of Mathematics, Pan Graph.
Index entries for linear recurrences with constant coefficients, signature (2,2,-4).
FORMULA
a(n) = 2^(n + 1) - 2^(floor(n/2) + 2).
a(n) = 2*(n-1) + 2*a(n-2) - 4*a(n-3).
G.f.: 8*x^3/((1 - 2*x)*(1 - 2*x^2)).
E.g.f.: 2*(1 + cosh(2*x) - 2*cosh(sqrt(2)*x) + sinh(2*x) - sqrt(2)*sinh(sqrt(2)*x)). - Stefano Spezia, Sep 07 2024
MAPLE
f := proc(n) option remember:
if n = 1 then 0 elif n = 2 then 0 elif n = 3 then 8 elif n >= 4 then 2 * procname(n-1) + 2* procname(n-2) - 4 * procname(n-3) fi; end:
A297619:=[seq(f(n), n = 0..10^2)]; # Muniru A Asiru, Jan 28 2018
MATHEMATICA
Table[2^(n + 1) - 2^(Floor[n/2] + 2), {n, 20}]
LinearRecurrence[{2, 2, -4}, {0, 0, 8}, 20]
CoefficientList[Series[(8 x^2)/(1 - 2 x - 2 x^2 + 4 x^3), {x, 0, 20}], x]
PROG
(PARI) first(n) = Vec(8*x^3/(1 - 2*x - 2*x^2 + 4*x^3) + O(x^(n+1)), -n) \\ Iain Fox, Jan 02 2018
(GAP) a := [0, 0, 8];; for n in [4..500] do a[n] := 2 * a[n-1] + 2 * a[n-2] - 4 * a[n-3]; od; a; # Muniru A Asiru, Jan 28 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Eric W. Weisstein, Jan 01 2018
STATUS
approved