login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A282518 Number of n-element subsets of [n+1] having a prime element sum. 2

%I #10 Feb 20 2017 09:01:14

%S 0,1,2,1,2,2,1,2,3,2,2,3,3,3,3,2,4,3,3,4,4,4,4,4,4,4,4,5,5,6,4,5,3,6,

%T 6,7,5,5,6,4,8,5,6,6,8,6,8,5,7,5,11,4,6,9,7,8,9,8,7,7,9,7,8,7,12,5,9,

%U 9,11,9,7,7,12,10,10,9,9,9,6,11,10,11,9,12

%N Number of n-element subsets of [n+1] having a prime element sum.

%H Alois P. Heinz, <a href="/A282518/b282518.txt">Table of n, a(n) for n = 0..20000</a>

%F a(n) = A282516(n+1,n).

%F a(n) = pi((n+1)*(n+2)/2)-pi(n*(n+1)/2) for n >= 3, pi = A000720.

%e a(1) = 1: {2}.

%e a(2) = 2: {1,2}, {2,3}.

%e a(3) = 1: {1,2,4}.

%e a(4) = 2: {1,2,3,5}, {1,3,4,5}.

%e a(5) = 2: {1,2,3,5,6}, {1,3,4,5,6}.

%e a(6) = 1: {1,2,3,4,6,7}.

%e a(7) = 2: {1,2,3,4,5,6,8}, {1,2,3,4,6,7,8}.

%e a(8) = 3: {1,2,3,4,5,6,7,9}, {1,2,3,5,6,7,8,9}, {1,3,4,5,6,7,8,9}.

%p a:= proc(n) option remember; (t-> add(`if`(isprime(

%p t-i), 1, 0), i=1..n+1))((n+1)*(n+2)/2)

%p end:

%p seq(a(n), n=0..100);

%Y Cf. A000720, A282516.

%Y Similar but different: A065382, A066888, A090970.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Feb 17 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 11:59 EDT 2024. Contains 371254 sequences. (Running on oeis4.)