|
Search: id:A015592
|
|
|
| A015592 |
|
a(n) = 10 a(n-1) + 11 a(n-2). |
|
+0
2
|
|
| 0, 1, 10, 111, 1220, 13421, 147630, 1623931, 17863240, 196495641, 2161452050, 23775972551, 261535698060, 2876892678661, 31645819465270, 348104014117971, 3829144155297680, 42120585708274481
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
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 (deutsch(AT)duke.poly.edu), Apr 01 2004
|
|
FORMULA
|
a(n)=11^(n-1)-a(n-1). G.f.=x/(1-10x-11x^2). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 01 2004
a(n)=-(1/12)*(-1)^n+(1/12)*11^n, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jul 15 2008
|
|
CROSSREFS
|
Sequence in context: A087545 A078252 A014993 this_sequence A122574 A084031 A066275
Adjacent sequences: A015589 A015590 A015591 this_sequence A015593 A015594 A015595
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Olivier Gerard (ogerard(AT)ext.jussieu.fr)
|
|
|
Search completed in 0.002 seconds
|
