Search: id:A001172
Results 1-1 of 1 results found.

%I A001172 M4085 N1694
%S A001172 2,6,10,22,34,48,60,78,84,90,114,144,120,168,180,234,246,288,240,210,324,
%T A001172 300,360,474,330,528,576,390,462,480,420,570,510,672,792,756,876,714,
%U A001172 798,690,1038,630,1008,930,780,960,870,924,900,1134,1434,840,990,1302
%N A001172 Smallest even number which is an unordered sum of two odd primes in exactly 
               n ways.
%C A001172 a(n)=A023036(n) for all n > 1.
%C A001172 Except for initial term, the same as A023036.
%D A001172 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A001172 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%H A001172 T. D. Noe, <a href="b001172.txt">Table of n, a(n) for n=0..10000</a>
%H A001172 <a href="Sindx_Go.html#Goldbach">Index entries for sequences related 
               to Goldbach conjecture</a>
%t A001172 a = Table[0, {55}]; Do[c = 0; k = 3; While[k <= n/2, If[PrimeQ[k] && 
               PrimeQ[n - k], c++ ]; k++ ]; If[c < 56 && a[[c]] == 0, a[[c]] = n], 
               {n, 6, 1310, 2}]
%Y A001172 Cf. A000954, A000974, A002375
%Y A001172 Sequence in context: A080715 A034168 A055745 this_sequence A167512 A055895 
               A125527
%Y A001172 Adjacent sequences: A001169 A001170 A001171 this_sequence A001173 A001174 
               A001175
%K A001172 nonn,nice,easy
%O A001172 0,1
%A A001172 N. J. A. Sloane (njas(AT)research.att.com), Eric Wolman

Search completed in 0.001 seconds