OFFSET
0,1
COMMENTS
Competition number of the complete bipartite graph K_{n,n}.
Formula given on p. 3 of Sano.
LINKS
Yoshio Sano, The competition numbers of regular polyhedra, arXiv:0905.1763 [math.CO], 2009.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).
FORMULA
a(n) = a(n-1)+2*n-3 (with a(0)=2). - Vincenzo Librandi, Dec 03 2010
a(n) = 3*a(n-1) -3*a(n-2) +a(n-3).
G.f.: (2-5*x+5*x^2)/(1-x)^3.
a(n) = A002522(n-1). - Michel Marcus, Feb 03 2016
MATHEMATICA
Table[n^2-2*n+2, {n, 0, 5!}] (* Vladimir Joseph Stephan Orlovsky, Dec 29 2010 *)
LinearRecurrence[{3, -3, 1}, {2, 1, 2}, 60] (* Harvey P. Dale, Mar 29 2015 *)
PROG
(PARI) vector(100, n, n--; n^2 - 2*n + 2)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Jonathan Vos Post, May 14 2009
EXTENSIONS
More terms from Vincenzo Librandi, Nov 08 2009
Sequence corrected by Joerg Arndt, Dec 03 2010
STATUS
approved