|
Search: id:A140995
|
|
|
| A140995 |
|
Triangle read by rows: recurence G(n,k): G(n, n)=G(n+1, 0)=1, G(n+2, 1)=2, G(n+3, 2)=4, G(n+4, 3)=8, G(n+5, k)=G(n+1, k-3)+G(n+1, k-4)+G(n+2, k-3)+G(n+3, k-2)+ G(k+4, k-1), for k:=5..(n+5). |
|
+0
2
|
|
| 1, 1, 1, 1, 2, 1, 1, 2, 4, 1, 1, 2, 4, 8, 1, 1, 2, 4, 8, 16, 1, 1, 2, 4, 8, 17, 31, 1, 1, 2, 4, 8, 17, 35, 60, 1, 1, 2, 4, 8, 17, 35, 72, 116, 1, 1, 2, 4, 8, 17, 35, 72, 148, 224, 1, 1, 2, 4, 8, 17, 35, 72, 149, 303, 432, 1, 1, 2, 4, 8, 17, 35, 72, 149, 308, 618, 833, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
EXAMPLE
|
Triangle begins:
1
1 1
1 2 1
1 2 4 1
1 2 4 8 1
1 2 4 8 161
1 2 4 8 17 31 1
1 2 4 8 17 35 60 1
1 2 4 8 17 35 72 116 1
1 2 4 8 17 35 72 148 224 1
1 2 4 8 17 35 72 149 303 432 1
1 2 4 8 17 35 72 149 308 618 833 1
|
|
CROSSREFS
|
Cf. A007318.
Adjacent sequences: A140992 A140993 A140994 this_sequence A140996 A140997 A140998
Sequence in context: A030018 A010739 A023506 this_sequence A141021 A140994 A140993
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Jul 08 2008
|
|
|
Search completed in 0.002 seconds
|
