|
Search: id:A140996
|
|
|
| A140996 |
|
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, n+3)=8, G(n+5, k)=G(n+1, k-1)+G(n+1, k)+G(n+2, k)+G(n+3, k)+ G(k+4, k), for k:=1..(n+1). |
|
+0
2
|
|
| 1, 1, 1, 1, 2, 1, 1, 4, 2, 1, 1, 8, 4, 2, 1, 1, 16, 8, 4, 2, 1, 1, 31, 17, 8, 4, 2, 1, 1, 60, 35, 17, 8, 4, 2, 1, 1, 116, 72, 35, 17, 8, 4, 2, 1, 1, 224, 148, 72, 35, 17, 8, 4, 2, 1, 1, 432, 303, 149, 72, 35, 17, 8, 4, 2, 1, 1, 833, 618, 308, 149, 72, 35, 17, 8, 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 16 8 4 2 1
1 31 17 8 4 2 1
1 60 35 17 8 4 2 1
1 116 72 35 17 8 4 2 1
1 224 148 72 35 17 8 4 2 1
1 432 303 149 72 35 17 8 4 2 1
1 833 618 308 149 72 35 17 8 4 2 1
|
|
CROSSREFS
|
Cf. A007318.
Sequence in context: A114394 A059623 A140997 this_sequence A141020 A152568 A057728
Adjacent sequences: A140993 A140994 A140995 this_sequence A140997 A140998 A140999
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Jul 08 2008
|
|
|
Search completed in 0.002 seconds
|
