网页A116619给出10000个2p的哥猜数,它们的哥猜数与数字相近的各个偶数相比是较小的:
A116619 a(n) = number of ways of representing 2*prime(n) as the unordered sum of two primes.
1, 1, 2, 2, 3, 3, 4, 2, 4, 4, 3, 5, 5, 5, 5, 6, 6, 4, 6, 8, 6, 5, 6, 7, 7, 9, 7, 8, 7, 7, 9, 9, 11, 7, 11, 9, 9, 7, 11, 9, 10, 8, 10, 12, 11, 7, 11, 12, 12, 9, 13, 11, 11, 15, 14, 15, 14, 10, 11, 14, 13, 13, 15, 17, 12, 14, 14, 15, 19, 14, 19, 15, 15, 18, 15, 17, 15, 17, 16, 17, 17, 18, 17……
|