|
|
A338528型 |
| 将k*n划分为两部分(s,t)的数量,其中s<=t,t|k*s表示k=1..n。 |
|
0
|
|
|
0, 2, 2, 5, 4, 11, 7, 13, 11, 19, 11, 27, 15, 28, 30, 34, 20, 45, 23, 52, 46, 49, 28, 71, 45, 58, 54, 78, 37, 105, 42, 81, 77, 79, 85, 124, 51, 90, 91, 137, 57, 156, 61, 134, 143, 115, 67, 178, 102, 160, 128, 162, 75, 187, 150, 206, 144, 143, 84, 276, 91, 156, 213, 199, 181, 263
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,2
|
|
链接
|
|
|
配方奶粉
|
a(n)=Sum_{k=1..n}Sum_{i=1..地板(n*k/2)}(1-天花板(k*i/(k*n-i))+地板(k*i/(k*n-i)))。
|
|
例子
|
a(6)=11;6*1、6*2……的11个分区。。。,6*6分为2部分(s,t),其中s<=t和t |k*s对于k=1..n为:
6: (3,3),
12: (4,8), (6,6),
18: (9,9),
24: (8,16), (12,12),
30: (5,25), (15,15),
36: (9,24), (12,24), (18,18).
|
|
数学
|
表[Sum[Sum[(1-天花板[k*i/(k*n-i)]+地板[k*i/(k*n-i)]),{i,地板[kxn/2]}],{k,n}],}n,50}]
|
|
交叉参考
|
|
|
关键词
|
非n
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|