|
Search: id:A094864
|
|
|
| A094864 |
|
a(0)=1, a(1)=2, a(2)=6, a(3)=18; for n>=4, a(n) = 6*a(n-1)-11*a(n-2)+6*a(n-3)-a(n-4). |
|
+0
3
|
|
| 1, 2, 6, 18, 53, 154, 443, 1264, 3582, 10092, 28291, 78962, 219541, 608318, 1680438, 4629414, 12722033, 34882954, 95451407, 260698732, 710802606, 1934955072, 5259642751, 14277467618, 38707663273, 104816737274, 283521290598, 766112145594, 2068131437357
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
E. Barcucci, R. Pinzani and R. Sprugnoli, Directed column-convex polyominoes by recurrence relations, Lecture Notes in Computer Science, No. 668, Springer, Berlin (1993), pp. 282-298.
S. Rinaldi, D. G. Rogers, How the odd terms in the Fibonacci sequence stack up, Math. Gaz. vol 90, no 519 (2006) pp. 431-442.
|
|
LINKS
|
S. Rinaldi, D. G. Rogers, How the odd terms in the Fibonacci sequence stack up, 8th Nordic Comb. Conf, Aalborg, Denmark, Oct 20 2004.
|
|
FORMULA
|
O.g.f: -(2*x-1)*(x-1)^2/(x^2-3*x+1)^2 = (-1-2*x)/(x^2-3*x+1)+(2-5*x)/(x^2-3*x+1)^2 . - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 02 2007
|
|
CROSSREFS
|
Sequence in context: A077984 A052979 A005507 this_sequence A120010 A132790 A072850
Adjacent sequences: A094861 A094862 A094863 this_sequence A094865 A094866 A094867
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jun 14 2004
|
|
|
Search completed in 0.002 seconds
|
