|
|
A153125号 |
| 按行读取的三角形:T(n,k)=n X k棋盘上皇后可以覆盖的最大方块数,1<=k<=n。 |
|
三
|
|
|
1, 2, 4, 3, 6, 9, 4, 7, 10, 12, 5, 8, 11, 14, 17, 6, 9, 12, 15, 18, 20, 7, 10, 13, 16, 19, 22, 25, 8, 11, 14, 17, 20, 23, 26, 28, 9, 12, 15, 18, 21, 24, 27, 30, 33, 10, 13, 16, 19, 22, 25, 28, 31, 34, 36, 11, 14, 17, 20, 23, 26, 29, 32, 35, 38, 41, 12, 15, 18, 21, 24, 27, 30, 33, 36
(列表;桌子;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,2
|
|
评论
|
T(n,2*k-1)=T(n-1,2*k-1)+1,对于2*k-1<n。
|
|
链接
|
|
|
配方奶粉
|
T(n,k)=n+3*(k-1)-(1-n Mod 2)*增量{n,k},1<=k<=n;delta是Kronecker符号。
|
|
例子
|
三角形T(n,k)开始于:
1;
2、4;
3, 6, 9;
4, 7, 10, 12;
5, 8, 11, 14, 17;
6, 9, 12, 15, 18, 20;
7, 10, 13, 16, 19, 22, 25;
8, 11, 14, 17, 20, 23, 26, 28;
|
|
数学
|
T[n_,k_]:=n+3*(k-1)-(1-Mod[n,2])*如果[k==n,1,0];
扁平[表格[表格[T[n,k],{k,1,n}],{n,1,20}]]
|
|
交叉参考
|
|
|
关键词
|
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|