|
Search: id:A027052
|
|
|
| A027052 |
|
Triangular array T read by rows: T(n,0)=T(n,2n)=1 for n >= 0, T(n,1)=0 for n >= 1, T(n,2)=1 for n >= 2 and for n >= 3, T(n,k)=T(n-1,k-3)+T(n-1,k-2)+T(n-1,k-1) for 3<=k<=2n-1. |
|
+0
38
|
|
| 1, 1, 0, 1, 1, 0, 1, 2, 1, 1, 0, 1, 2, 3, 4, 1, 1, 0, 1, 2, 3, 6, 9, 8, 1, 1, 0, 1, 2, 3, 6, 11, 18, 23, 18, 1, 1, 0, 1, 2, 3, 6, 11, 20, 35, 52, 59, 42, 1, 1, 0, 1, 2, 3, 6, 11, 20, 37, 66, 107, 146, 153, 102, 1, 1, 0, 1, 2, 3, 6, 11, 20, 37, 68, 123, 210
(list; table; graph; listen)
|
|
|
OFFSET
|
1,8
|
|
|
COMMENT
|
The following sequences all have the same parity: A004737, A006590, A027052, A071028, A071797, A078358, A078446. - Jeremy Gardiner (jeremy.gardiner(AT)btinternet.com), Mar 16 2003
|
|
CROSSREFS
|
Many columns of T (in triangular form) are A001590, a tribonacci sequence.
Sequence in context: A131334 A004602 A059571 this_sequence A131257 A105806 A129501
Adjacent sequences: A027049 A027050 A027051 this_sequence A027053 A027054 A027055
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.002 seconds
|
