|
|
A015552
|
|
a(n) = 6*a(n-1) + 7*a(n-2), a(0) = 0, a(1) = 1.
|
|
13
|
|
|
0, 1, 6, 43, 300, 2101, 14706, 102943, 720600, 5044201, 35309406, 247165843, 1730160900, 12111126301, 84777884106, 593445188743, 4154116321200, 29078814248401, 203551699738806, 1424861898171643, 9974033287201500, 69818233010410501, 488727631072873506
(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_8. Example: a(2)=6 because the walks of length 2 between the nodes A and B of the complete graph ABCDEFGH are: ACB, ADB, AEB, AFB, AGB and AHB. - Emeric Deutsch, Apr 01 2004
General form: k=7^n-k. Also: A001045, A078008, A097073, A115341, A015518, A054878, A015521, A109499, A015531, A109500, A109501. - Vladimir Joseph Stephan Orlovsky, Dec 11 2008
The ratio a(n+1)/a(n) converges to 7 as n approaches infinity. - Felix P. Muga II, Mar 09 2014
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 6*a(n-1) + 7*a(n-2).
G.f.: x/(1-6*x-7*x^2).
a(n) = 7^(n-1) - a(n-1). (End)
|
|
EXAMPLE
|
G.f. = x + 6*x^2 + 43*x^3 + 300*x^4 + 2101*x^5 + 14706*x^6 + 102943*x^7 + ...
|
|
MAPLE
|
|
|
MATHEMATICA
|
Table[(7^n - (-1)^n)/8, {n, 0, 30}] (* G. C. Greubel, Dec 2017 *)
|
|
PROG
|
(PARI) {a(n) = if ( n<0, 0, (7^n - (-1)^n) / 8)};
(Sage) [lucas_number1(n, 6, -7) for n in range(0, 21)] # Zerinvary Lajos, Apr 24 2009
|
|
CROSSREFS
|
Cf. A001045, A078008, A097073, A115341, A015518, A054878, A015521, A109499, A015531, A109500, A109501. - Vladimir Joseph Stephan Orlovsky, Dec 11 2008
|
|
KEYWORD
|
nonn,easy,changed
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|