login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015592 a(n) = 10*a(n-1) + 11*a(n-2). 4
0, 1, 10, 111, 1220, 13421, 147630, 1623931, 17863240, 196495641, 2161452050, 23775972551, 261535698060, 2876892678661, 31645819465270, 348104014117971, 3829144155297680, 42120585708274481 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

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

General form: k=11^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

FORMULA

a(n) = 11^(n-1) - a(n-1). G.f.: x/(1 - 10x - 11x^2). - Emeric Deutsch, Apr 01 2004

a(n) = -(1/12)*(-1)^n + (1/12)*11^n, with n>=0. - Paolo P. Lava, Jul 15 2008

MATHEMATICA

k=0; lst={k}; Do[k=11^n-k; AppendTo[lst, k], {n, 0, 5!}]; lst (* Vladimir Joseph Stephan Orlovsky, Dec 11 2008 *)

PROG

(Sage) [lucas_number1(n, 10, -11) for n in range(0, 18)] # Zerinvary Lajos, Apr 26 2009

(MAGMA) [-(1/12)*(-1)^n+(1/12)*11^n: n in [0..20]]; // Vincenzo Librandi, Oct 11 2011

CROSSREFS

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

Sequence in context: A087545 A078252 A014993 * A122574 A176736 A084031

Adjacent sequences:  A015589 A015590 A015591 * A015593 A015594 A015595

KEYWORD

nonn,easy

AUTHOR

Olivier Gérard

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 30 21:40 EST 2020. Contains 338831 sequences. (Running on oeis4.)