Search: a010911 -id:a010911
|
|
A108153
|
|
a(n) = 3*a(n-1) + 2*a(n-2) + a(n-3).
|
|
+10
4
|
|
|
0, 1, 3, 11, 40, 145, 526, 1908, 6921, 25105, 91065, 330326, 1198213, 4346356, 15765820, 57188385, 207443151, 752472043, 2729490816, 9900859685, 35914032730, 130273308376, 472548850273, 1714107200301, 6217692609825, 22553841080350, 81811015661001
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 11*a(n-2) +7*a(n-3)+3*a(n-4). [Gary Detlefs, Sep 13 2010]
|
|
MATHEMATICA
|
M = {{0, 1, 0}, {0, 0, 1}, {1, 2, 3}} a3 = Table[MatrixPower[M, i][[1, 3]], {i, 1, 50}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Definition replaced by the Adamson recurrence - the Associate Editors of the OEIS, Sep 28 2009
|
|
STATUS
|
approved
|
|
|
Search completed in 0.004 seconds
|