A015609 a(n) = 11*a(n-1) + 12*a(n-2).

0, 1, 11, 133, 1595, 19141, 229691, 2756293, 33075515, 396906181, 4762874171, 57154490053, 685853880635, 8230246567621, 98762958811451, 1185155505737413, 14221866068848955, 170662392826187461

Offset

0,3

Comments

Number of walks of length n between any two distinct nodes of the complete graph K_13. Example: a(2)=11 because the walks of length 2 between the nodes A and B of the complete graph ABCDEFGHIJKLM are ACB, ADB, AEB, AFB, AGB, AHB, AIB, AJB, AKB, ALB and AMB. - Emeric Deutsch, Apr 01 2004

General form: k=12^n-k. Also: A001045, A078008, A097073, A115341, A015518, A054878, A015521, A109499, A015531, A109500, A109501, A015552, A093134, A015565, A015577, A015585. - Vladimir Joseph Stephan Orlovsky, Dec 11 2008

Links

Vincenzo Librandi, Table of n, a(n) for n = 0..900

Index entries for linear recurrences with constant coefficients, signature (11,12).

Formula

From Emeric Deutsch, Apr 01 2004: (Start)

a(n) = 12^(n-1) - a(n-1).

G.f.: x/(1 - 11*x - 12*x^2). (End)

E.g.f.: exp(-x)*(exp(13*x) - 1)/13. - Stefano Spezia, Mar 11 2020

Mathematica

CoefficientList[Series[x/(1-11*x-12*x^2), {x, 0, 50}], x] (* or *) LinearRecurrence[{11, 12}, {0, 1}, 30] (* G. C. Greubel, Dec 30 2017 *)

Prog

(Sage) [lucas_number1(n, 11, -12) for n in range(0, 18)] # Zerinvary Lajos, Apr 27 2009
(Sage) [abs(gaussian_binomial(n, 1, -12)) for n in range(0, 18)] # Zerinvary Lajos, May 28 2009
(Magma) [(1/13)*(12^n-(-1)^n): n in [0..20]]; // Vincenzo Librandi, Oct 11 2011
(PARI) x='x+O('x^30); concat([0], Vec(x/(1-11*x-12*x^2))) \\ G. C. Greubel, Dec 30 2017

Crossrefs

Cf. A001045, A078008, A097073, A115341, A015518, A054878, A015521, A109499, A015531, A109500, A109501, A015552, A093134, A015565, A015577, A015585, A015592. - Vladimir Joseph Stephan Orlovsky, Dec 11 2008

Sequence in context: A289415 A051431 A014994 * A250460 A367245 A157773

Adjacent sequences: A015606 A015607 A015608 * A015610 A015611 A015612

Keyword

nonn,easy

Author

Olivier Gérard

Status

approved