cp's OEIS Frontend

A117499 Number of subsets of {n-1, n, n+1} that sum up to a prime.

%I A117499 #13 Jul 13 2013 12:03:23
%S A117499 4,4,4,3,2,4,2,2,2,2,2,3,1,2,2,2,1,3,2,2,2,2,2,2,0,1,1,1,2,4,2,1,1,1,
%T A117499 1,3,2,1,1,2,2,3,1,2,1,1,1,2,1,1,2,2,2,3,1,1,1,1,1,2,1,1,1,1,1,2,1,2,
%U A117499 2,2,1,2,1,2,2,1,0,2,2,1,1,2,2,2,0,1,1,1,2,3,1,0,0,0,1,3,2,2,2,2,1,2,1,1,1
%N A117499 Number of subsets of {n-1, n, n+1} that sum up to a prime.
%C A117499 0 <= a(n) <= 4; a(A066388(n)) = 4.
%C A117499 a(A221309(n)) = 0; a(A221310(n)) = 4. - _Reinhard Zumkeller_, Jan 10 2013
%H A117499 Reinhard Zumkeller, <a href="/A117499/b117499.txt">Table of n, a(n) for n = 1..10000</a>
%F A117499 a(n) = A010051(n-1) + A010051(n) + A010051(n+1) + A010051(2*n-1) + A010051(2*n) + A010051(2*n+1).
%e A117499 a(1) = #{2, 0+2=2, 1+2=3, 0+1+2=3} = 4;
%e A117499 a(2) = #{2, 3, 1+2=3, 2+3=5} = 4;
%e A117499 a(3) = #{2, 3, 2+3=5, 3+4=7} = 4;
%e A117499 a(4) = #{3, 5, 3+4=7} = 3;
%e A117499 a(5) = #{5, 5+6=11} = 2.
%t A117499 Table[Length[Select[{-1+n,n,1+n,-1+2 n,2 n,1+2 n,3 n},PrimeQ]],{n,105}]
%t A117499 ssp[{a_,b_,c_}]:=Count[Subsets[{a,b,c},3],_?(PrimeQ[Total[#]]&)]; ssp/@ Partition[ Range[0,110],3,1] (* _Harvey P. Dale_, Jan 29 2013 *)
%o A117499 (Haskell)
%o A117499 a117499 1 = sum $ map a010051 [1, 2, 0 + 1, 0 + 2, 1 + 2, 0 + 1 + 2]
%o A117499 a117499 n = sum $ map a010051 [n - 1, n, n + 1, 2 * n - 1, 2 * n + 1]
%o A117499 -- _Reinhard Zumkeller_, Jan 10 2013
%Y A117499 Cf. A010051.
%K A117499 nonn
%O A117499 1,1
%A A117499 _Reinhard Zumkeller_, Mar 23 2006