显示找到的11个结果中的1-10个。
Z的置换,通过反射杂耍序列获得A084521美元从正数到负数(零在拍0处抛出),用函数N2Z和Z2N折叠成N。
+20 7
1, 8, 2, 12, 4, 10, 6, 16, 3, 18, 7, 14, 5, 24, 13, 20, 9, 22, 11, 30, 17, 28, 19, 26, 15, 34, 25, 36, 23, 38, 21, 32, 33, 42, 27, 46, 29, 44, 31, 40, 41, 52, 35, 48, 39, 54, 37, 50, 45, 60, 49, 58, 43, 62, 47, 56, 57, 68, 53, 70, 51, 64, 55, 66, 63, 76, 65, 78, 59, 74, 61, 72
MAPLE公司
N2Z:=n->((-1)^n)*楼层(n/2);
Z2N:=z->2*abs(z)+`if`((z<1),1,0);
7, 7, 11, 7, 11, 13, 7, 19, 11, 7, 19, 13, 7, 11, 13, 14, 7, 11, 21, 14, 7, 19, 11, 13, 7, 19, 13, 14, 7, 19, 25, 13, 7, 19, 25, 14, 7, 35, 19, 11, 7, 35, 19, 13, 7, 35, 21, 11, 7, 35, 21, 14, 7, 35, 25, 13, 7, 35, 25, 14, 7, 11, 21, 26, 13, 7, 11, 37, 19, 13, 7, 11, 37, 26, 13, 7
3, 42, 441, 522, 531, 4440, 4530, 5241, 5340, 5511, 5520, 6222, 6231, 6312, 6330, 6411, 6420, 45501, 46131, 46401, 52440, 52530, 53502, 55140, 55500, 56112, 56130, 56202, 56400, 62241, 62340, 62511, 62520, 63141, 63501, 64140, 64500, 66111
评论
请注意,此十进制表示法仅适用于A084520号(A084527号(10) )-1=1919项,即99600000,之后是1920次解10,2,2,2,2,2,2,2,2,通常表示为“A2222222”。
1, 2, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6
1, 3, 2, 5, 6, 4, 9, 7, 8, 12, 11, 10, 14, 15, 16, 13, 18, 20, 19, 17, 23, 21, 24, 22, 27, 26, 28, 25, 31, 32, 29, 30, 35, 36, 34, 33, 40, 37, 38, 39, 44, 41, 43, 42, 48, 46, 45, 47, 52, 50, 51, 49, 56, 55, 53, 54, 60, 59, 58, 57, 62, 64, 65, 61, 63, 67, 70, 66, 69, 68, 72, 75
16, 6, 3, 1, 2, 7, 37, 181, 799, 3503, 14365, 58033, 225215
一个由三个球组成的无限杂耍序列:按字典顺序列出的连续较大的不可分解的地面状态三球站点交换。的子集A084501号.
+10 13
3, 4, 2, 4, 4, 1, 5, 2, 2, 5, 3, 1, 4, 4, 4, 0, 4, 5, 1, 2, 4, 5, 3, 0, 5, 2, 4, 1, 5, 3, 4, 0, 5, 5, 1, 1, 5, 5, 2, 0, 6, 2, 2, 2, 6, 2, 3, 1, 6, 3, 1, 2, 6, 3, 3, 0, 6, 4, 1, 1, 6, 4, 2, 0, 4, 4, 5, 0, 2, 4, 5, 1, 4, 1, 4, 5, 5, 0, 1, 4, 6, 1, 2, 2, 4, 6, 1, 3, 1, 4, 6, 3, 0, 2, 4, 6, 4, 0, 1, 5, 2, 4, 4, 0, 5
评论
所谓“不可分解”,我们的意思是与每个循环相关的杂耍状态序列在最后一次抛出之前不应返回到基态7(xxx)。也就是说,这意味着A084515号给出了所有7s(基态)的位置A084513号.
人们可以接受任何子序列A084511号[A084515号(i) +1。。A084515号(j) ](j>i)并尝试定期处理它,或将其交给j.i.S.提供的Siteswap动画师之一,例如,通过使用术语4-12,可以获得站点交换模式“441522531”。
例子
连续的站点交换是:3;4,2; 4,4,1; 5,2,2; 5,3,1; 4,4,4,0; 4,5,1,2; 4,5,3,0; ... 请参阅A084512号.
三个球的无限杂耍序列:按字典顺序依次列出更大的地面状态三球站点交换。
+10 11
3, 3, 3, 4, 2, 3, 3, 3, 3, 4, 2, 4, 2, 3, 4, 4, 1, 5, 2, 2, 5, 3, 1, 3, 3, 3, 3, 3, 3, 4, 2, 3, 4, 2, 3, 3, 4, 4, 1, 3, 5, 2, 2, 3, 5, 3, 1, 4, 2, 3, 3, 4, 2, 4, 2, 4, 4, 1, 3, 4, 4, 4, 0, 4, 5, 1, 2, 4, 5, 3, 0, 5, 2, 2, 3, 5, 2, 4, 1, 5, 3, 1, 3, 5, 3, 4, 0, 5, 5, 1, 1, 5, 5, 2, 0, 6, 2, 2, 2, 6, 2, 3, 1, 6, 3
评论
每个可能的有限周期三球异步站点交换都作为该序列的子序列发生。例如,“51”(三球淋浴)第一次出现在a(65)=5,a(66)=1。
我们通过遍历Polster的书或Knutson的Siteswap常见问题解答第7节(但不受投掷高度的限制)中描述的三球状态图中连续较大长度的每个可能循环,从基态7(xxx)开始,到基态7结束,并按字典顺序串联这些序列,从而获得序列。
人们可以接受任何子序列A084501美元[i.j]这样A084503号(i-1)=A084503号(j) =7,并尝试定期处理它,或将其交给j.I.S.提供的Siteswap动画师之一,例如,通过使用前39个术语,可以获得站点交换模式“33342333424234415225313333342334441”。
参考文献
B.Polster,《拼凑的数学》,Springer-Verlag出版社,2003年,第45页。
例子
连续的站点交换是:3;3,3; 4,2; 3,3,3; 3,4,2; 4,2,3; 4,4,1; 5,2,2; 5,3,1; 3,3,3,3; ... 请参阅A084502号.
0, 1, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 18, 19, 19, 19, 19, 19, 20, 20, 20, 20, 20, 21, 21, 21
0, 1, 3, 6, 9, 12, 16, 20, 24, 28, 32, 36, 40, 44, 48, 52, 56, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110, 115, 120, 125, 130, 135, 140, 145, 150, 155, 160, 165, 170, 175, 180, 185, 190, 195, 200, 205, 210, 215, 220, 225, 230, 235, 240, 245, 250, 255, 260, 265
评论
对于n>=1,(a(n-1)+1,a(n))=(1,1),(2,3),(4,6),(7,9),(10,12),。。。给出了序列中第n个站点交换的开始和结束偏移A084521美元.还给出了7s(基态)在中的位置A084523号.
搜索在0.010秒内完成
|