|
Search: id:A005059
|
|
| |
|
| 0, 1, 8, 49, 272, 1441, 7448, 37969, 192032, 966721, 4853288, 24325489, 121804592, 609554401, 3049366328, 15251614609, 76272421952, 381405156481, 1907154922568, 9536162033329, 47681972428112
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Comment from David W. Wilson: Number of lines passing through 3 points of an n-dimensional grid of points of side 3.
|
|
REFERENCES
|
M. A. Alekseyev and T. Berger, On the expected number of random moves to solve the Tower of Hanoi puzzle, Preprint, 2008.
|
|
FORMULA
|
a(n)=8*a(n-1)-15*a(n-2). G.f.: x/((1-3x)(1-5x)). - Paul Barry (pbarry(AT)wit.ie), Mar 03 2003
Sum(2^(k-1)*3^(n-k)*binomial(n, k),k=1..n). - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Sep 24 2006
|
|
PROGRAM
|
(Other) sage: [lucas_number1(n, 8, 15) for n in xrange(0, 21)]# [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 23 2009]
|
|
CROSSREFS
|
Sequence in context: A166789 A081901 A026389 this_sequence A026719 A026774 A089383
Adjacent sequences: A005056 A005057 A005058 this_sequence A005060 A005061 A005062
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
