|
Search: id:A092964
|
|
|
| A092964 |
|
Triangle read by rows in which row n gives the number of equal configurations under cyclic shift. |
|
+0
3
|
|
| 1, 2, 2, 2, 3, 2, 3, 5, 5, 3, 3, 7, 8, 7, 3, 4, 9, 14, 14, 9, 4, 4, 12, 20, 25, 20, 12, 4, 5, 15, 30, 42, 42, 30, 15, 5, 5, 18, 40, 66, 75, 66, 40, 18, 5, 6, 22, 55, 99, 132, 132, 99, 55, 22, 6, 6, 26, 70, 143, 212, 245, 212, 143, 70, 26, 6, 7, 30, 91, 200, 333, 429, 429, 333, 200
(list; table; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
T(n,k)=A051168(n+3,k+1), if 0<k<=n. - Michael Somos, Jul 17 2004
|
|
EXAMPLE
|
1; 2,2; 2,3,2; 3,5,5,3; 3,7,8,7,3; 4,9,14,14,9,4; 4,12,20,25,20,12,4; ...
|
|
PROGRAM
|
(PARI) T(n, k)=local(A, ps, c); n+=3; k++; if(k<1|k>=n-1, 0, A=x*O(x^n)+y*O(y^n); ps=1-x-y+A; for(m=1, n, for(i=0, m, c=polcoeff(polcoeff(ps, i, x), m-i, y); if(m==n&i==k, break(2), ps*=(1-y^(m-i)*x^i+A)^c))); -c) /* Michael Somos, Jul 17 2004 */
|
|
CROSSREFS
|
Row sums give A093210.
Row sums give A093210. Essentially same as A051168.
Adjacent sequences: A092961 A092962 A092963 this_sequence A092965 A092966 A092967
Sequence in context: A058769 A116997 A050142 this_sequence A076709 A110021 A036013
|
|
KEYWORD
|
nonn,tabl,uned,obsc
|
|
AUTHOR
|
Thomas O. Hoffbauer (Thomas.Hoffbauer(AT)cibamberg.de), Apr 20 2004
|
|
|
Search completed in 0.002 seconds
|
