|
Search: id:A140997
|
|
|
| A140997 |
|
Triangle read by rows: recurence G(n,k): G(n, 0)=G(n+1, n+1)=1, G(n+2, n+1)=2, G(n+3, n+2)=4, G(n+4, k)=G(n+1, k-2)+G(n+1, k-3)+G(n+2, k-2)+ G(k+3, k-1), for k:=1..(n+1). |
|
+0
1
|
|
| 1, 1, 1, 1, 2, 1, 1, 4, 2, 1, 1, 8, 4, 2, 1, 1, 15, 9, 4, 2, 1, 1, 28, 19, 9, 4, 2, 1, 1, 2, 52, 40, 19, 9, 4, 2, 1, 1, 96, 83, 41, 19, 9, 4, 2, 1, 1, 177, 170, 88, 41, 19, 9, 4, 2, 1, 1, 326, 345, 188, 88, 41, 19, 9, 4, 2, 1, 1, 600, 694, 400, 189, 88, 41, 19, 9, 4, 2, 1, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
EXAMPLE
|
Triangle begins:
1
1 1
1 2 1
1 4 2 1
1 8 4 2 1
1 15 9 4 2 1
1 28 19 9 4 2 1
1 52 40 19 9 4 2 1
1 96 83 41 19 9 4 2 1
1 177 170 88 41 19 9 4 2 1
1 326 345 188 88 41 19 9 4 2 1
1 600 694 400 189 88 41 19 9 4 2 1
|
|
CROSSREFS
|
Cf. A007318.
Sequence in context: A048004 A114394 A059623 this_sequence A140996 A057728 A098050
Adjacent sequences: A140994 A140995 A140996 this_sequence A140998 A140999 A141000
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Jul 08 2008
|
|
|
Search completed in 0.002 seconds
|
