Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078648
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078648 Smallest integer that can be written in exactly n ways as the sum of two primes that are not congruent modulo 3. +0
4
5, 18, 24, 36, 48, 60, 78, 84, 90, 114, 144, 120, 168, 180, 234, 246, 288, 240, 210, 324, 300, 360, 474, 330, 528, 576, 390, 462, 480, 420, 570, 510, 672, 792, 756, 876, 714, 798, 690, 1038, 630, 1008, 930, 780, 960, 870, 924, 900, 1134, 1434, 840, 990, 1302 (list; graph; listen)
OFFSET

1,1

EXAMPLE

18 is the first integer that can be written in exactly two ways as the sum of two congruent primes modulo 3: 18 = 5 + 13 = 7 + 11 (order of addition is ignored). Hence a(2) = 18.

MATHEMATICA

f[n_] := Module[{a, d, i}, a = {}; u = Floor[n/2]; For[i = 1, i <= u, i++, If[PrimeQ[i] && PrimeQ[n - i] && Mod[i, 3] != Mod[n - i, 3], a = Append[a, {n, i, n - i}]]]; a]; a = Table[0, {55}]; Do[l = Length[ f[n]]; If[l < 56 && a[[l]] == 0, a[[l]] = n], {n, 1, 2500}]; a

CROSSREFS

Sequence in context: A097491 A120087 A022142 this_sequence A035338 A055371 A034098

Adjacent sequences: A078645 A078646 A078647 this_sequence A078649 A078650 A078651

KEYWORD

nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Dec 13 2002

EXTENSIONS

Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 19 2002

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research