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!)
A333176 a(n) = Sum_{k=1..n} (binomial(n,k) mod 2) * prime(k). 1

%I #8 Mar 10 2020 10:28:54

%S 2,3,10,7,20,23,58,19,44,51,112,63,140,151,328,53,114,117,250,131,276,

%T 287,604,161,342,355,742,383,798,825,1720,131,270,273,566,289,596,607,

%U 1252,323,664,675,1392,711,1458,1481,3046,407,832,839,1718,875,1782

%N a(n) = Sum_{k=1..n} (binomial(n,k) mod 2) * prime(k).

%F Sum_{k=1..n} (-1)^A010060(n-k) * (binomial(n,k) mod 2) * a(k) = prime(n).

%t Table[Sum[Mod[Binomial[n, k], 2] Prime[k], {k, 1, n}], {n, 1, 53}]

%o (PARI) a(n) = sum(k=1, n, if (binomial(n, k) % 2, prime(k))); \\ _Michel Marcus_, Mar 10 2020

%Y Cf. A000040, A007443, A007504, A010060, A030015, A050513.

%K nonn

%O 1,1

%A _Ilya Gutkovskiy_, Mar 10 2020

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 April 19 17:51 EDT 2024. Contains 371797 sequences. (Running on oeis4.)