|
Search: id:A027926
|
|
|
| A027926 |
|
Triangular array T read by rows: T(n,0)=T(n,2n)=1 for n >= 0; T(n,1)=1 for n >= 1; T(n,k)=T(n-1,k-2)+T(n-1,k-1) for k=2,3,...,2n-1, n >= 2. |
|
+0
23
|
|
| 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 3, 4, 3, 1, 1, 1, 2, 3, 5, 7, 7, 4, 1, 1, 1, 2, 3, 5, 8, 12, 14, 11, 5, 1, 1, 1, 2, 3, 5, 8, 13, 20, 26, 25, 16, 6, 1, 1, 1, 2, 3, 5, 8, 13, 21, 33, 46, 51, 41, 22, 7, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 54, 79, 97, 92, 63, 29
(list; graph; listen)
|
|
|
OFFSET
|
0,7
|
|
|
COMMENT
|
T(n,k) = number of strings s(0),...,s(n) such that s(0)=0, s(n)=n-k, and for 1<=i<=n, s(i)=s(i-1)+d, with d in {0,1,2} if i=0, in {0,2} if s(i)=2i, in {0,1,2} if s(i)=2i-1, in {0,1} if 0<=s(i)<=2i-2.
|
|
FORMULA
|
T(n, k)=sum(binomial(n-j, 2n-k-2j), j=0..floor[(2n-k+1)/2]). - Len Smiley (smiley(AT)math.uaa.alaska.edu), Oct 21 2001
|
|
EXAMPLE
|
1; 1 1 1; 1 1 2 2 1; 1 1 2 3 4 3 1; 1 1 2 3 5 7 7 4 1; ...
|
|
PROGRAM
|
(PARI) T(n, k)=if(k<0|k>2*n, 0, sum(j=max(0, k-n), k\2, binomial(k-j, j)))
|
|
CROSSREFS
|
Many columns of T are A000045 (Fibonacci sequence), also in T: A001924, A004006, A000071, A000124, A014162, A014166, A027927-A027933.
Adjacent sequences: A027923 A027924 A027925 this_sequence A027927 A027928 A027929
Sequence in context: A047070 A071127 A029381 this_sequence A114730 A031282 A085685
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
EXTENSIONS
|
Incorporates comments from Michael Somos
|
|
|
Search completed in 0.002 seconds
|
