|
2^n的单计哥猜数
Number of ways writing 2^n as unordered sums of 2 primes.
A006307
0 0
1 0
2 1
3 1
4 2
5 2
6 5
7 3
8 8
9 11
10 22
11 25
12 53
13 76
14 151
15 244
16 435
17 749
18 1314
19 2367
20 4239
21 7471
22 13705
23 24928
24 45746
25 83467
26 153850
27 283746
28 525236
29 975685
30 1817111
31 3390038
32 6341424
33 11891654
34 22336060
35 42034097
36 79287664
37 149711134
38 283277225
39 536710100
40 1018369893
愚工688通过精确计算,将此类偶数的哥猜数扩大到2^50,现复录于此:
G(2^41)= 1934814452,
G(2^42)= 3680759328,
G(2^43)= 7010898161,
G(2^44)= 13369466800,
G(2^45)= G(35184372088832) = 25522944188 ,
G(2^46)= G(70368744177664) = 48776696083 ,
G(2^47)= G(140737488355328) = 93311971184,(time use 11658.95 sec )~3.238h,
G(2^48)= G( 281474976710656 ) = 178680063951 , (time use 27491.85 sec )~7.64h
G(2^49)= G( 562949953421312 ) = 342469661688,(time use ? sec )
G(2^50)= G(1125899906842624) = 656978437719,(133767.06 sec)=37h 9'27" |
|