login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065577 Number of Goldbach partitions of 10^n. 9
2, 6, 28, 127, 810, 5402, 38807, 291400, 2274205, 18200488, 149091160, 1243722370, 10533150855, 90350630388 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Number of ways of writing 10^n as the sum of two odd primes, when the order does not matter.

LINKS

Ivars Peterson's MathTrek, Goldbach's Prime Pairs

Science News Online, week of Aug. 19, 2000; Vol. 158, No. 8 Goldbach's Prime Pairs

FORMULA

a(n)=A061358(10^n). Cf. A073610, A107318.

EXAMPLE

a(1)=2 because 10 = 3+7 = 5+5;

a(2)=6 because 100 = 3+97 = 11+89 = 17+83 = 29+71 = 41+59 = 47+53; ...

MATHEMATICA

NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; f[n_] := Block[{c = 0, lmt = n/2, p = 3}, While[p <= lmt, If[ PrimeQ[n - p], c++ ]; p = NextPrim@p]; c]; Array[f, 10] (* Robert G. Wilson v Nov 01 2006 *)

CROSSREFS

Cf. A001031.

Sequence in context: A089748 A047125 A189238 * A152393 A004984 A184695

Adjacent sequences:  A065574 A065575 A065576 * A065578 A065579 A065580

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 01 2001

EXTENSIONS

a(9) from Zak Seidov (zakseidov(AT)yahoo.com) Nov 01 2006

a(10) from R. J. Mathar and David W. Wilson, Nov 02 2006

a(11) from David W. Wilson and Russ Cox, Nov 03 2006

a(12) from Russ Cox, Nov 04 2006

a(13) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Nov 16 2009

a(14) from Huang Yuanbing (bailuzhou(AT)163.com), Dec 24 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 17:46 EST 2012. Contains 205835 sequences.