搜索: a268728-id:a268728
|
|
|
|
0, 1, 0, 1, 2, 0, 0, 0, 7, 0, 1, 0, 3, 4, 0, 0, 2, 0, 3, 13, 0, 1, 0, 0, 0, 0, 14, 0, 1, 0, 4, 2, 0, 1, 11, 0, 1, 2, 7, 7, 1, 0, 1, 8, 0, 0, 0, 7, 0, 0, 1, 0, 0, 25, 0, 1, 0, 0, 4, 5, 15, 6, 0, 3, 26, 0, 1, 2, 0, 4, 13, 3, 10, 0, 0, 3, 31, 0, 1, 0, 0, 6, 0, 14, 2, 0, 6, 0, 0, 28, 0, 0, 0, 3, 0, 12, 4, 11, 7, 26, 1, 0, 1, 21, 0
(列表;桌子;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,5
|
|
评论
|
|
|
链接
|
|
|
例子
|
阵列的左上[1..19]x[1..19]部分:
0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1
0, 2, 0, 0, 2, 0, 0, 2, 0, 0, 2, 0, 0, 2, 0, 0, 2, 0, 0
0, 7, 3, 0, 0, 4, 7, 7, 0, 0, 0, 3, 3, 0, 0, 0, 7, 7, 0
0, 4, 3, 0, 2, 7, 0, 4, 4, 6, 0, 3, 7, 0, 0, 0, 3, 0, 2
0, 13, 0, 0, 1, 0, 5, 13, 0, 12, 13, 0, 0, 8, 0, 0, 13, 0, 0
0, 14, 1, 0, 1, 15, 3, 14, 4, 15, 0, 1, 14, 13, 0, 0, 15, 10, 14
0, 11, 1, 0, 6, 10, 2, 11, 9, 13, 7, 1, 0, 9, 11, 0, 0, 2, 10
0, 8, 0, 0, 0, 0, 7, 8, 0, 0, 11, 0, 6, 15, 0, 0, 8, 0, 0
0, 25, 3, 0, 6, 26, 2, 25, 12, 31, 14, 3, 1, 27, 9, 0, 0, 21, 25
0, 26, 3, 0, 1, 25, 1, 26, 1, 27, 13, 3, 11, 27, 3, 0, 8, 27, 0
0, 31, 0, 0, 5, 0, 0, 31, 0, 26, 14, 0, 14, 0, 0, 0, 17, 0, 11
0, 28, 1, 0, 6, 29, 3, 28, 0, 26, 3, 1, 8, 31, 15, 0, 11, 28, 19
0,21,1,0,0,20,1,21,12,0,8,1,8,20,0,8,25,8
0, 22, 0, 0, 6, 0, 4, 22, 0, 16, 10, 0, 9, 18, 0, 0, 14, 0, 9
0, 19, 3, 0, 5, 16, 5, 19, 4, 22, 10, 3, 12, 22, 2, 0, 18, 23, 10
0, 16, 3, 0, 5, 19, 4, 16, 9, 21, 15, 3, 11, 20, 15, 0, 10, 25, 16
0, 49, 0, 0, 2, 0, 3, 49, 0, 51, 0, 0, 3, 50, 0, 0, 1, 0, 26
0, 50, 1, 0, 0, 51, 0, 50, 12, 0, 13, 1, 8, 0, 0, 0, 1, 62, 3
0, 55, 1, 0, 2, 54, 1, 55, 1, 53, 1, 1, 2, 54, 2, 0, 2, 54, 26
|
|
黄体脂酮素
|
|
|
交叉参考
|
|
|
关键词
|
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|
|
A269158型
|
| 方形数组A(行,列)=F(行,(2*col)-1),其中F(0,q)=FA003188号(q) ,F(2p+1,q)=F(q模2p+1、2p+1)“异或”(2p+1AND q)。通过降序反对偶读取数组,如A(1,1)、A(1,2)、A。。。 |
|
+10个 8
|
|
|
0, 0, 1, 0, 2, 1, 0, 7, 3, 0, 0, 4, 3, 0, 1, 0, 13, 3, 0, 2, 0, 0, 14, 1, 0, 5, 1, 1, 0, 11, 1, 0, 2, 4, 0, 1, 0, 8, 1, 0, 1, 7, 7, 2, 1, 0, 25, 3, 0, 1, 12, 7, 7, 0, 0, 0, 26, 3, 0, 6, 15, 5, 4, 0, 0, 1, 0, 31, 3, 0, 5, 10, 3, 13, 4, 2, 2, 1, 0, 28, 1, 0, 6, 11, 2, 14, 9, 6, 0, 3, 1, 0, 21, 1, 0, 1, 26, 7, 11, 4, 12, 0, 3, 0, 0
(列表;桌子;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,5
|
|
评论
|
数组给出了二元函数F(p,q)的值,该函数只有在q为奇数时才被明确定义,因此,虽然这里它的参数p从1开始获得所有整数值,但参数q只获得奇数1、3、5、7、9。。。作为其价值观。
对于所有k>=0,任何行n也作为行(4^k*n)出现。
|
|
链接
|
|
|
配方奶粉
|
A(行,列)=F(行,(2*col)-1),其中函数F定义为:如果p<=1,F(p,q)=0,否则如果p是奇数>1,FA003188号(q) ●●●●。
|
|
例子
|
阵列的左上[1..16]x[1..25]部分:
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
1, 2, 7, 4, 13, 14, 11, 8, 25, 26, 31, 28, 21, 22, 19, 16
1, 3, 3, 3, 1, 1, 1, 3, 3, 3, 1, 1, 1, 3, 3, 3
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
1, 2, 5, 2, 1, 1, 6, 5, 6, 1, 5, 6, 1, 6, 5, 5
0、1、4、7、12、15、10、11、26、25、30、29、20、21、16、19
1, 0, 7, 7, 5, 3, 2, 7, 2, 1, 5, 3, 1, 4, 5, 4
1, 2, 7, 4, 13, 14, 11, 8, 25, 26, 31, 28, 21, 22, 19, 16
1, 0, 0, 4, 9, 4, 9, 5, 12, 1, 0, 0, 12, 9, 4, 9
0, 0, 2, 6, 12, 15, 13, 13, 31, 27, 26, 26, 20, 16, 22, 21
1, 2, 0, 0, 13, 11, 7, 11, 14, 13, 14, 3, 8, 10, 10, 15
1, 3, 3, 3, 1, 1, 1, 3, 3, 3, 1, 1, 1, 3, 3, 3
1, 0, 3, 7, 0, 14, 13, 6, 1, 11, 14, 8, 8, 9, 12, 11
0, 2, 0, 3, 8, 13, 9, 15, 27, 27, 26, 31, 20, 18, 22, 20
1, 0, 0, 0, 12, 0, 11, 15, 9, 3, 14, 15, 4, 8, 2, 15
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
1, 2, 7, 3, 13, 15, 0, 8, 17, 8, 17, 11, 8, 14, 18, 10
0, 2, 7, 0, 4, 10, 2, 13, 21, 27, 31, 28, 25, 31, 23, 25
1, 0, 0, 2, 0, 14, 10, 0, 25, 19, 11, 19, 8, 9, 10, 16
1, 2, 5, 2, 1, 1, 6, 5, 6, 1, 5, 6, 1, 6, 5, 5
1, 0, 0, 0, 1, 15, 11, 11, 0, 26, 21, 10, 17, 15, 10, 15
0, 0, 7, 4, 0, 5, 12, 3, 23, 23, 17, 31, 29, 28, 25, 31
1, 2, 3, 4, 1, 0, 13, 8, 26, 0, 31, 23, 13, 19, 8, 11
0、1、4、7、12、15、10、11、26、25、30、29、20、21、16、19
1、0、0、0、5、1、1、13、25、25、0、28、25、12、25、13
|
|
数学
|
F[p_,q_]:=F[p,q]=其中[p<=1,0,p>1&&OddQ[p],F[Mod[q,p],p]~BitX或~BitAnd[p,q],True,F[p/2,q]~Bit X或~bitX或[q,Floor[q/2]];
A[n_,k_]:=F[n,2k-1];
|
|
黄体脂酮素
|
(方案)
;; A269158auxbi可以作为尾递归循环实现:
(定义(A269158auxbi p q)(if(not(odd?q))(错误“A269158bi:第二个参数应该是奇数:”p q)
;; 或递归(反映给定的递归公式):
(定义(A269158auxbi p q)(条件((<=p 1)0)(偶数?p)(A003987bi(A003188号q) ))(其他(A003987bi(A269158auxbi(模q p)p)(A004198bi p q)))
|
|
交叉参考
|
囊性纤维变性。A065621号(出现在第2行、第8行,通常情况下,出现在n>=0的任何第2^(2n+1)行。似乎也以斜对角线F(2n+1,2n-1)的形式出现。)
|
|
关键词
|
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|
|
268829元
|
| 方形数组A(行,列)=B(行,(2*col)-1),其中如果gcd(p,q)>1,B(p,q=0,否则为1+2*F(p,q),其中F的定义如A269158型数组通过降序反对偶读取,如A(1,1)、A(1,2)、A。。。 |
|
+10个 6
|
|
|
1,1,3,1,5,3,1,15,0,1,1,9,7,1,3,1,27,7,1,5,1,1,29,0,1,0,3,1,23,3,1,5,9,1,3,1,17,3,1,3,3,15,15,5,3,1,51,0,1,3,0,15,0,1,1,53,7,1,13,31,11,9,1,3,1,63,7,1,21,7,27,9,0,5,3,1,57,0,1,13,0,5,29,0,13,1,0,3,1,43,3,1,3,53,15,23,9,25,1,7,1,1
(列表;桌子;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,3
|
|
链接
|
|
|
配方奶粉
|
A(i,j)=B(i,(2*j)-1),其中,如果gcd(p,q)>1,B(p,q=0,并且1+2*F(p,q)=1+2*A269158型(p,(q+1)/2)否则,其中函数F定义为A269158型.
|
|
例子
|
阵列的左上[1..16]x[1..25]部分:
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
3, 5, 15, 9, 27, 29, 23, 17, 51, 53, 63, 57, 43, 45, 39, 33
3,0,7,7,0,3,3,0,7,7,0,3,3,0,7,7
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
3, 5, 0, 5, 3, 3, 13, 0, 13, 3, 11, 13, 0, 13, 11, 11
1, 0, 9, 15, 0, 31, 21, 0, 53, 51, 0, 59, 41, 0, 33, 39
3, 1, 15, 0, 11, 7, 5, 15, 5, 3, 0, 7, 3, 9, 11, 9
3, 5, 15, 9, 27, 29, 23, 17, 51, 53, 63, 57, 43, 45, 39, 33
3, 0, 1, 9, 0, 9, 19, 0, 25, 3, 0, 1, 25, 0, 9, 19
1, 1, 0, 13, 25, 31, 27, 0, 63, 55, 53, 53, 0, 33, 45, 43
3, 5, 1, 1, 27, 0, 15, 23, 29, 27, 29, 7, 17, 21, 21, 31
3, 0, 7, 7, 0, 3, 3, 0, 7, 7, 0, 3, 3, 0, 7, 7
3, 1, 7, 15, 1, 29, 0, 13, 3, 23, 29, 17, 17, 19, 25, 23
1, 5, 1, 0, 17, 27, 19, 31, 55, 55, 0, 63, 41, 37, 45, 41
3, 0, 0, 1, 0, 1, 23, 0, 19, 7, 0, 31, 0, 0, 5, 31
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
3, 5, 15, 7, 27, 31, 1, 17, 0, 17, 35, 23, 17, 29, 37, 21
1, 0, 15, 1, 0, 21, 5, 0, 43, 55, 0, 57, 51, 0, 47, 51
3、1、1、5、1、29、21、1、51、0、23、39、17、19、21、33
3, 5, 0, 5, 3, 3, 13, 0, 13, 3, 11, 13, 0, 13, 11, 11
3, 0, 1, 0, 0, 31, 23, 0, 1, 53, 0, 21, 35, 0, 21, 31
1, 1, 15, 9, 1, 0, 25, 7, 47, 47, 35, 63, 59, 57, 51, 63
3, 5, 7, 9, 3, 1, 27, 17, 53, 1, 63, 0, 27, 39, 17, 23
1, 0, 9, 15, 0, 31, 21, 0, 53, 51, 0, 59, 41, 0, 33, 39
3, 1, 0, 1, 11, 3, 3, 0, 51, 51, 1, 57, 0, 25, 51, 27
|
|
黄体脂酮素
|
(方案)
;; 以下是一个更独立的实现:
(定义(A268829auxbi p q)(if(not(odd?q)))(错误“A268829 auxbi:第二个参数应该是奇数:”p q“)(let loop((p)(q q)(s 0))(cond((zero?p)0)((=1 p)(+1(*2 s))))-问题1)2))
|
|
交叉参考
|
|
|
关键词
|
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|
|
|
|
0,98305,3,0,6,98306,2,98305,12,98311,14,3,1,98307,9,0,24,98317,24,6,16,98319,27,98306,0,98304,23,2,30,98312,2,98305,48,98329,0,12,52,98329,6,98311,3,98321,3,14,98330,3,3,41,98305,43,1,4,98326,45,98307,6,98335,43,9,27,98307,19,0,27、98353、2、24、100、98305、1
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,2
|
|
评论
|
|
|
链接
|
|
|
配方奶粉
|
其他身份。对于n=1..65536:
|
|
黄体脂酮素
|
(方案)
;; 两个变量在n=1..65536范围内给出了相同的结果:
|
|
交叉参考
|
|
|
关键词
|
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|
|
|
|
0, 1, 3, 0, 6, 2, 2, 1, 4, 7, 6, 3, 1, 3, 1, 0, 0, 5, 0, 6, 0, 7, 3, 2, 0, 0, 7, 2, 6, 0, 2, 1, 0, 1, 0, 4, 4, 1, 6, 7, 3, 1, 3, 6, 6, 2, 3, 3, 1, 1, 3, 1, 4, 6, 5, 3, 6, 7, 3, 1, 3, 3, 3, 0, 3, 1, 2, 0, 4, 1, 1, 5, 6, 5, 7, 0, 0, 7, 4, 6, 0, 2, 7, 0, 6, 2, 1, 7, 3, 7, 2, 3, 5, 2, 2, 2, 1, 0, 2, 0, 3, 2, 4, 0, 3, 5, 0, 7, 4, 4, 6, 2, 2, 7, 0, 6, 1, 2, 2, 0
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,3
|
|
链接
|
|
|
配方奶粉
|
|
|
黄体脂酮素
|
(方案)
|
|
交叉参考
|
|
|
关键词
|
非n
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
搜索在0.010秒内完成
|