本网站由以下捐款支持:OEIS基金会.

分解树

来自OeisWiki
跳转到:航行,搜索


这篇文章的页面是一个存根,请通过展开它来提供帮助。


在不同的整数分解树人们可能会想到递归平方分解到素数的二叉树(递归分解为中心因子直至素数的二叉树)看起来最有趣。

递归平方分解到素数的二叉树

这个平方因子分解,即进入核心因素,第页,共页
n个=·j个, 2   ≤    ≤  j个,
最小化
j个 − 
j个 ⁄ 
.它对应于面积为
n个
。这有最小的半周长(A063655号),自
=+j个=+
n个
d日
d日
= 1  − 
n个
2
=0,即。n个=2
.
48/       \6         8/ \       / \2   3     2   4/ \2 2个

这个二叉树递归平方因子分解,即成为中心因子,直至素数

  • 素数作为叶节点;
  • 奇数节点(除根节点外,所有节点都是成对的中心因子);
  • 偶数边缘(显然,所有边都是成对的)。
递归平方分解二叉树的节点数
n个=·j个, 2   ≤    ≤  j个,
节点(n个)=1+总和(节点(),个节点(j个)).
递归平方分解二叉树的层数
n个=·j个, 2   ≤    ≤  j个,
水平(n个)=1+最大值(水平(),级别(j个)).

A162348号n的中心因子对(i,j),例如i*j=n,其中i是n的最大因子,j是n的最小因子。

{1, 1, 1, 2, 1, 3, 2, 2, 1, 5, 2, 3, 1, 7, 2, 4, 3, 3, 2, 5, 1, 11, 3, 4, 1, 13, 2, 7, 3, 5, 4, 4, 1, 17, 3, 6, 1, 19, 4, 5, 3, 7, 2, 11, 1, 23, 4, 6, 5, 5, 2, 13, 3, 9, 4, 7, 1, 29, 5, 6, 1, 31, 4, ...}

A033676美元n的最大除数<=sqrt(n)。

{1, 1, 1, 2, 1, 2, 1, 2, 3, 2, 1, 3, 1, 2, 3, 4, 1, 3, 1, 4, 3, 2, 1, 4, 5, 2, 3, 4, 1, 5, 1, 4, 3, 2, 5, 6, 1, 2, 3, 5, 1, 6, 1, 4, 5, 2, 1, 6, 7, 5, 3, 4, 1, 6, 5, 7, 3, 2, ...}

A033677号n>=sqrt(n)的最小除数。

{1,2,3,2,5,3,7,4,3,5,11,4,13,7,5,4,17,6,19,5,7,11,23,6,5,13,9,7,29,6,31,8,11,17,7,6,37,19,13,8,41,7,43,11,9,23,47,8,7,10,17,…}
递归平方分解的二叉树
节点 边缘
(节点−1)
水平 高度
(级别-1)
1 清空产品 0 0
2 2 1 0 1 0
1 0 1 0
4 42 * 2 2 2 1
5 5 1 0 1 0
6 62 * 3 2 2 1
7 7 1 0 1 0
8 82 * 4 2 * (2 * 2) 5 4 2
9 93 * 3 2 2 1
10 102 * 5 2 2 1
11 11 1 0 1 0
12 123 * 4 3 * (2 * 2) 5 4 2
13 13 1 0 1 0
14 142 * 7 2 2 1
15 153 * 5 2 2 1
16 164 * 4 (2 * 2) * (2 * 2) 7 6 2
17 17 1 0 1 0
18 183 * 6 3 * (2 * 3) 5 4 2
19 19 1 0 1 0
20 204 * 5 (2 * 2) * 5 5 4 2
21 213 * 7 2 2 1
22 222 * 11 2 2 1
23 23 1 0 1 0
24 244 * 6 (2 * 2) * (2 * 3) 7 6 2
25 255 * 5 2 2 1
26 262 * 13 2 2 1
27 273 * 9 3 * (3 * 3) 5 4 2
28 284*7个(2 * 2) * 7 5 4 2
29 29 1 0 1 0
30 305 * 6 5 * (2 * 3) 5 4 2
节点 边缘
(节点-1)
水平 高度
(级别-1)
31 31 1 0 1 0
32 324 * 8 (2*2)*(2*4)(2 * 2) * (2 * (2 * 2)) 9 8 4
33 333 * 11 2 2 1
34 342 * 17 2 2 1
35 355 * 7 2 2 1
36 366 * 6 (2 * 3) * (2 * 3) 7 6 2
37 37 1 0 1 0
38 382 * 19 2 2 1
39 393 * 13 2 2 1
40 405 * 8 5 * (2 * 4) 5 * (2 * (2 * 2)) 7 6 4
41 41 1 0 1 0
42 426 * 7 (2 * 3) * 7 5 4 2
43 43 1 0 1 0
44 444 * 11 (2 * 2) * 11 5 4 2
45 455 * 9 5 * (3 * 3) 5 4 2
46 462 * 23 2 2 1
47 47 1 0 1 0
48 486 * 8 (2 * 3) * (2 * 4) (2 * 3) * (2 * (2 * 2)) 9 8 4
49 497 * 7 2 2 1
50 505 * 10 5*(2*5) 5 4 2
51 513 * 17 2 2 1
52 524 * 13 (2*2)*13 5 4 2
53 53 1 0 1 0
54 546 * 9 (2 * 3) * (3 * 3) 7 6 2
55 555*11个 2 2 1
56 567 * 8 7 * (2 * 4) 7 * (2 * (2 * 2)) 7 6 4
57 573 * 19 2 2 1
58 582 * 29 2 2 1
59 59 1 0 1 0
60 606 * 10 (2 * 3) * (2 * 5) 7 6 2

递归平方分解的二叉树具有k个边缘对
顺序 A编号
0 底漆: {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, ...} A000040型
1 双素: {4, 6, 9, 10, 14, 15, 21, 22, 25, 26, 33, 34, 35, 38, 39, 46, 49, 51, 55, 57, 58, 62, 65, 69, 74, 77, 82, 85, 86, 87, 91, 93, 94, 95, 106, 111, 115, ...} A001358号
2 {8, 12, 18, 20, 27, 28, 30, 42, 44, 45, 50, 52, ...} A??????
{16, 24, 36, 40, 54, 60, ...} A??????
4 {32, 48, ...} A??????
5 {?, ...} A??????
6 {?, ...} A??????
7 {?, ...} A??????
8 {?, ...} A??????
9 {?, ...} A??????
10 {?, ...} A??????
11 {?, ...} A??????
12 {?, ...} A??????
13 {?, ...} A??????
14 {?, ...} A??????
15 {?, ...} A??????
16 {?, ...} A??????
17 {?, ...} A??????
18 {?, ...} A??????
19 {?, ...} A??????
20 {?, ...} A??????
21 {?, ...} A??????
22 {?, ...} A??????
23 {?, ...} A??????
24 {?, ...} A??????
25 {?, ...} A??????
26 {?, ...} A??????
27 {?, ...} A??????
28 {?, ...} A??????
29 {?, ...} A??????
30 {?, ...} A??????

递归平方分解的二叉树具有k个水平(即高度k个− 1)
顺序 A编号
0 {1}  
1 底漆: {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, ...} A000040型
2 双素: {4, 6, 9, 10, 14, 15, 21, 22, 25, 26, 33, 34, 35, 38, 39, 46, 49, 51, 55, 57, 58, 62, 65, 69, 74, 77, 82, 85, 86, 87, 91, 93, 94, 95, 106, 111, 115, ...} A001358号
{8, 12, 16, 18, 20, 24, 27, 28, 30, 36, 42, 44, 45, 50, 52, 54, 56, 60, ...} A??????
4 {32, 40, 48, 56, ...} A??????
5 {?, ...} A??????
6 {?, ...} A??????
7 {?, ...} A??????
8 {?, ...} A??????
9 {?, ...} A??????
10 {?, ...} A??????
11 {?, ...} A??????
12 {?, ...} A??????
13 {?, ...} A??????
14 {?, ...} A??????
15 {?, ...} A??????
16 {?, ...} A??????
17 {?, ...} A??????
18 {?, ...} A??????
19 {?, ...} A??????
20 {?, ...} A??????
21 {?, ...} A??????
22 {?, ...} A??????
23 {?, ...} A??????
24 {?, ...} A??????
25 {?, ...} A??????
26 {?, ...} A??????
27 {?, ...} A??????
28 {?, ...} A??????
29 {?, ...} A??????
30 {?, ...} A??????