|
|
183244元 |
| T(n,k)=1…n+2*k-1的置换数,每个元素至少移位k。 |
|
8
|
|
|
1, 1, 2, 1, 4, 9, 1, 8, 29, 44, 1, 16, 112, 206, 265, 1, 32, 436, 1168, 1708, 1854, 1, 64, 1708, 6984, 13365, 15702, 14833, 1, 128, 6724, 41808, 114124, 159414, 159737, 133496, 1, 256, 26572, 250464, 998112, 1799688, 2036488, 1780696, 1334961, 1, 512
(列表;桌子;图表;参考文献;听;历史;文本;内部格式)
|
|
|
抵消
|
1,3
|
|
评论
|
表格开始
........1.........1..........1............1.............1...............1
........2.........4..........8...........16............32..............64
........9........29........112..........436..........1708............6724
.......44.......206.......1168.........6984.........41808..........250464
......265......1708......13365.......114124........998112.........8751552
.....1854.....15702.....159414......1799688......21201024.......252813312
....14833....159737....2036488.....29125117.....441629332......6860776320
...133496...1780696...27780408....486980182....9154333160....178195229760
..1334961..21599745..404351752...8490078104..192565379941...4564491262444
.14684570.283294740.6263006598.154750897552.4146526612518.116967725946488
|
|
链接
|
|
|
例子
|
1-5的所有排列,最小位移2:
(3,4,5,1,2) (3,4,5,2,1) (4,5,1,2,3) (5,4,1,2,3).
|
|
数学
|
T[n_,k_]:=永久[nrows=n+2k-1;表[If[Abs[i-j]<=k-1,0,1],{i,1,nrows},{j,1,n rows}]];表[t=t[n-k+1,k];打印[“T(”,n-k+1,“,”,k,“)=”,T];t、 {n、1、9}、{k、n、1和-1}]//展平(*Jean-François Alcover公司2016年1月7日,改编自Sage*)
|
|
黄体脂酮素
|
(鼠尾草)
返回矩阵(λi,j:0,如果abs(i-j)<=(k-1)else 1,nrows=n+2*k-1).permanent()#D.S.麦克尼尔2011年1月4日
|
|
交叉参考
|
|
|
关键词
|
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|