本帖最后由 yangchuanju 于 2021-12-5 22:15 编辑
A007963
Number of (unordered) ways of writing 2n+1 as a sum of 3 odd primes.
0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 6, 7, 6, 8, 7, 9, 10, 10, 10, 11, 12, 12, 14, 16, 14, 16, 16, 16, 18, 20, 20, 20, 21, 21, 21, 27, 24, 25, 28, 27, 28, 33, 29, 32, 35, 34, 30, 37, 36, 34, 42, 38, 36, 46, 42, 42, 50, 46, 47, 53, 50, 45, 56, 54, 46, 62, 53, 48, 64, 59, 55, 68, 61, 59, 68,……
无序3^x拆分成三奇素数和的方法数
x 3^x 单哥猜 增比
1 3 0 ——
2 9 1 ——
3 27 6 6
4 81 25 4.166666667
5 243 108 4.32
6 729 479 4.4352
7 2187 2594 5.4154
8 6561 14290 5.5089
9 19683 85429 5.9782
无序5^x拆分成三奇素数和的方法数
x 5^x 单哥猜 增比
1 5 0 ——
2 25 5 ——
3 125 53 10.6000
4 625 486 9.1698
5 3125 6213 12.7840
6 15625 79497 12.7953
无序7^x拆分成三奇素数和的方法数
x 7^x 单哥猜 增比
1 7 0 ——
2 49 12 ——
3 343 216 18
4 2401 4047 18.7361
5 16807 94711 23.4028
|