Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A112825
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A112825 Least even number k such that the Goldbach gap is 2n, or 0 if no such number exists. +0
3
4, 10, 14, 24, 22, 26, 36, 34, 50, 52, 46, 60, 58, 70, 62, 80, 78, 74, 84, 82, 86, 94, 100, 126, 114, 106, 120, 118, 130, 0, 138, 0, 134, 144, 142, 152, 158, 162, 176, 172, 166, 0, 178, 196, 0, 208, 198, 194, 204, 202, 230, 216, 214, 236, 0, 226, 0, 0, 0, 0, 258, 0, 254 (list; graph; listen)
OFFSET

0,1

FORMULA

A112823 - A020481.

EXAMPLE

a(1)=10 because the two Goldbach partitions of 10 are {3,7} & {5,5} and (5-3)/2=1.

MATHEMATICA

f[n_] := Block[{p = 2, q = n/2}, While[ !PrimeQ[p] || !PrimeQ[n - p], p++ ]; While[ !PrimeQ[q] || !PrimeQ[n - q], q-- ]; q - p]; t = Table[0, {100}]; Do[a = f[2n]; If[a < 100 && t[[a/2 + 1]] == 0, t[[a/2 + 1]] = 2n; Print[{2a, 2n}]], {n, 2, 10^4}]; Take[t, 63]

CROSSREFS

Cf. A020481.

Sequence in context: A114335 A099355 A060031 this_sequence A051741 A022382 A125302

Adjacent sequences: A112822 A112823 A112824 this_sequence A112826 A112827 A112828

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 05 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research