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!)
A350758 Sum of all (j+1)-th products of (n-2j) successive primes for j=0..floor(n/2). 2

%I #32 May 08 2022 08:45:23

%S 1,2,7,33,226,2420,31221,525917,9960028,228028812,6582873441,

%T 203832844657,7522104144920,307994276065974,13236129969377405,

%U 621482119947376921,32898794005805573210,1939157848567313376490,118255213619653849652599,7917287291057332412711339

%N Sum of all (j+1)-th products of (n-2j) successive primes for j=0..floor(n/2).

%H Alois P. Heinz, <a href="/A350758/b350758.txt">Table of n, a(n) for n = 0..350</a>

%F a(n) = Sum_{j=0..floor(n/2)} A096334(n-j,j).

%F a(n) mod 2 = A021913(n) for n>=1.

%e a(0) = 1.

%e a(1) = 2.

%e a(2) = 2*3 + 1 = 7.

%e a(3) = 2*3*5 + 3 = 33.

%e a(4) = 2*3*5*7 + 3*5 + 1 = 226.

%e a(5) = 2*3*5*7*11 + 3*5*7 + 5 = 2420.

%p b:= proc(n, k) option remember;

%p `if`(n=k, 1, b(n-1, k)*ithprime(n))

%p end:

%p a:= n-> add(b(n-j, j), j=0..n/2):

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

%t b[n_, k_] := b[n, k] = If[n == k, 1, b[n - 1, k]*Prime[n]];

%t a[n_] := Sum[b[n - j, j], {j, 0, n/2}];

%t Table[a[n], {n, 0, 20}] (* _Jean-François Alcover_, May 08 2022, after _Alois P. Heinz_ *)

%Y Antidiagonal sums of A096334.

%Y Cf. A000040, A002110, A021913.

%K nonn

%O 0,2

%A _Alois P. Heinz_, Jan 21 2022

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 August 26 06:07 EDT 2024. Contains 375454 sequences. (Running on oeis4.)