登录
A085578号
反对偶读取的数组:T(m,n)是具有1<=i<=m,i<=j<=n的不同乘积ij的数量,对于m>=1,n>=1。
0
1, 2, 2, 3, 3, 3, 4, 5, 5, 4, 5, 6, 6, 6, 5, 6, 8, 8, 8, 8, 6, 7, 9, 11, 9, 11, 9, 7, 8, 11, 12, 13, 13, 12, 11, 8, 9, 12, 15, 15, 14, 15, 15, 12, 9, 10, 14, 17, 19, 17, 17, 19, 17, 14, 10, 11, 15, 18, 20, 22, 18, 22, 20, 18, 15, 11, 12, 17, 20, 22, 24, 24, 24, 24, 22, 20, 17, 12, 13, 18, 23, 24, 27, 27, 25, 27, 27, 24, 23, 18, 13
抵消
1, 2
例子
数组开始:
1 2 3 4 5 6 7 8 9 10 ...
2 3 5 6 8 9 11 12 14 15 ...
3 5 6 8 11 12 15 17 18 20 ...
4 6 8 9 13 15 19 20 22 24 ...
5 8 11 13 14 17 22 24 27 28 ...
MAPLE公司
T:=(m,n)->nops({seq(seq(i*j,i=1..m),j=1..n)});
数学
T[m_,n_]:=长度[Union@@表[i*j,{i,m},{j,n}]]
关键词
非n,
作者
迈克尔·克莱伯2003年7月9日
状态
经核准的