|
Search: id:A015531
|
|
|
| A015531 |
|
Linear 2nd order recurrence: a(n) = 4 a(n-1) + 5 a(n-2). |
|
+0
17
|
|
| 0, 1, 4, 21, 104, 521, 2604, 13021, 65104, 325521, 1627604, 8138021, 40690104, 203450521, 1017252604, 5086263021, 25431315104, 127156575521, 635782877604, 3178914388021, 15894571940104, 79472859700521
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Number of walks of length n between any two distinct vertices of the complete graph K_6. Example: a(2)=4 because the walks of length 2 between the vertices A and B of the complete graph ABCDEF are: ACB, ADB, AEB and AFB. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 01 2004
General form: k=5^n-k. Also: A001045, A078008, A097073, A115341, A015518, A054878, A015521, A109499 [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 11 2008]
|
|
FORMULA
|
a(n)=5^n/6-(-1)^n/6. G.f.: x/((1-5x)(1+x)). E.g.f. (exp(5x)-exp(-x))/6. - Paul Barry (pbarry(AT)wit.ie), Apr 20 2003
a(n)=sum{k=1..n, binomial(n, k)(-1)^(n+k)*6^(k-1) }. - Paul Barry (pbarry(AT)wit.ie), May 13 2003
a(n)=5^(n-1) - a(n-1). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 01 2004
((2+sqrt9)^n-(2-sqrt9)^n)/6 in Fibonacci form. Offset 1. a(3)=21. [From Al Hakanson (hawkuu(AT)gmail.com), Jan 07 2009]
|
|
MATHEMATICA
|
k=0; lst={k}; Do[k=5^n-k; AppendTo[lst, k], {n, 0, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 11 2008]
|
|
PROGRAM
|
(Other) sage: [lucas_number1(n, 4, -5) for n in xrange(0, 22)]# [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 23 2009]
|
|
CROSSREFS
|
A083425 shifted right.
Cf. A001045, A078008, A097073, A115341, A015518, A054878, A015521, A109499 [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 11 2008]
Sequence in context: A080043 A113022 A014986 this_sequence A083425 A100237 A117381
Adjacent sequences: A015528 A015529 A015530 this_sequence A015532 A015533 A015534
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Olivier Gerard (olivier.gerard(AT)gmail.com)
|
|
|
Search completed in 0.003 seconds
|
