搜索: a065627-编号:a065626
|
|
|
|
1, 4, 3, 8, 2, 6, 7, 16, 17, 9, 5, 12, 13, 14, 15, 32, 33, 34, 35, 18, 19, 10, 11, 24, 25, 26, 27, 28, 29, 30, 31, 64, 65, 66, 67, 68, 69, 70, 71, 36, 37, 38, 39, 20, 21, 22, 23, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 72, 73, 74, 75, 76, 77, 78, 79, 40
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,2
|
|
链接
|
|
|
MAPLE公司
|
[seq(旋转节点左(2,j),j=1..120)];
|
|
交叉参考
|
|
|
关键词
|
非n
|
|
作者
|
|
|
状态
|
已批准
|
|
|
|
|
|
|
3, 1, 1, 7, 5, 1, 2, 3, 2, 1, 6, 2, 7, 2, 1, 14, 11, 4, 3, 2, 1, 15, 6, 5, 9, 3, 2, 1, 4, 7, 3, 5, 4, 3, 2, 1, 5, 4, 15, 6, 11, 4, 3, 2, 1, 12, 10, 8, 7, 6, 5, 4, 3, 2, 1, 13, 22, 9, 4, 7, 13, 5, 4, 3, 2, 1, 28, 23, 10, 19, 8, 7, 6, 5, 4, 3, 2, 1, 29, 12, 11, 10, 9, 8, 15, 6, 5, 4, 3, 2, 1, 30, 13, 6, 11, 5, 9, 8, 7, 6, 5, 4, 3, 2, 1, 31, 14, 14, 12, 23, 10, 9, 17, 7, 6, 5, 4, 3, 2
(列表;桌子;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
0.1个
|
|
评论
|
考虑以下无限二叉树,其中节点从顶部以宽度第一、从左到右的方式编号为:
.............................1............................
.............2...............................3............
.....4...............5...............6...............7....
.8.......9.......10.....11.......12.....13.......14.....15
等,即节点Y是节点X的后代,如果其二进制扩展(最高有效位)从X的二进制扩展开始。
在该表中,第n行是由节点n向右旋转引起的排列,并且在该表中A065626号相应的行给出了由节点n向左旋转引起的该置换的逆。该树的特殊实现是Christoffel树和Stern-Brocot树(A007305号/A007306号)因此,每一个此类旋转或此类旋转的组合(例如。A065249号)在有理数上归纳出一个特殊的双射函数,这些函数形成了卡梅隆定义的有理数的保序排列的“a群”。
|
|
链接
|
|
|
MAPLE公司
|
[seq(旋转右表(j),j=0..119)];
RotateRightTable:=n->RotateNodeRight(1+(n-((triv(n)*(trin(n)-1))/2)),((trin;
#按以下方式重写带t前缀的x:t->t1,t1…->t11…,t0->t,t01…->t10…,t00…->t…并保留其他x的完整性。
RotateNodeRight:=proc(t,x)局部u,y;u:=地板_日志2(t)+1;y:=地板_日志2(x)+1;如果(y<u),则返回(x);fi;如果(floor(x/(2^(y-u))<>t),则返回(x);fi;如果(x=t),则返回((2*x)+1);fi;如果(1=(楼层(x/(2^(y-u-1)))mod 2)),则返回(x+(t*2^;fi;如果(y=(u+1)),则返回(x/2);fi;如果(1=(楼层(x/(2^(y-u-2)))mod 2)),则返回(x+2^(y-u-2);fi;返回(x-(t*2^(y-u-1));结束;
|
|
交叉参考
|
|
|
关键词
|
|
|
作者
|
|
|
状态
|
已批准
|
|
|
|
|
|
|
1, 2, 3, 9, 5, 6, 7, 4, 19, 10, 11, 12, 13, 14, 15, 8, 18, 38, 39, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 16, 17, 36, 37, 76, 77, 78, 79, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 32, 33, 34, 35, 72, 73, 74, 75, 152, 153, 154, 155, 156, 157, 158, 159, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,2
|
|
链接
|
|
|
MAPLE公司
|
[seq(RotateNodeRight(4,j),j=1..120)];
|
|
交叉参考
|
|
|
关键词
|
非n
|
|
作者
|
|
|
状态
|
已批准
|
|
|
|
|
|
|
1, 2, 3, 4, 5, 6, 7, 17, 9, 10, 11, 12, 13, 14, 15, 8, 35, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 16, 34, 70, 71, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 32, 33, 68, 69, 140, 141, 142, 143, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,2
|
|
链接
|
|
|
MAPLE公司
|
[seq(RotateNodeRight(8,j),j=1..120)];
|
|
交叉参考
|
|
|
关键词
|
非n
|
|
作者
|
|
|
状态
|
已批准
|
|
|
搜索在0.007秒内完成
|