|
|
A180007
|
|
Number of Goldbach partitions of 6^n.
|
|
4
|
|
|
1, 4, 13, 49, 161, 656, 2751, 12505, 58482, 280348, 1374563, 6864809
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Number of ways of writing 6^n as the sum of two odd primes, when the order does not matter. Number of ways writing 6^n as unordered sums of 2 primes. This is to 6 as A006307 is to 2 and as A065577 is to 10. This is the 6th row of the array A[k,n] = Number of ways writing k^n as unordered sums of 2 primes.
A061358(4^n) starts 1, 2, 5, 8, 22, 53, 151, 435, for n=1,2,... (bisection of A006307). A061358(8^n) starts 1, 5, 11, 53, 244, 1314, 7471, (tri-section of A006307). A061358(10^n) = A065577(n). A061358(12^n) = 1, 11, 53, 348, 2523, 20564... A061358(14^n) = 2, 9, 50, 330, 2924, 27225,... - R. J. Mathar, Aug 07 2010
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(1) = 1 because 6^1 = 6 = 3+3.
a(2) = 4 because 6^2 = 36 = 5+31 = 7+29 = 13+23 = 17+19.
a(3) = 13 because 6^3 = 216 = 5+211 = 17+199 = 19+197 = 23+193 = 37+179 = 43+173 = 53+163 = 59+157 = 67+149 = 79+137 = 89+127 = 103+113 = 107+109.
|
|
MAPLE
|
A061358 := proc(n) local a, p ; a := 0 ; p := nextprime(floor((n-1)/2)) ; while p <= n do if isprime(n-p) then a := a+1 ; end if; p := nextprime(p) ; end do ; return a; end proc:
for n from 1 do printf("%d, \n", A180007(n)) ; end do:
|
|
MATHEMATICA
|
Table[Count[Sort@ IntegerPartitions[6^n, {2}], {u_, v_} /; And[PrimeQ@ u, u != 2, PrimeQ@ v]], {n, 6}] (* Michael De Vlieger, Jun 02 2015 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|