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!)
A135483 a(n) = Sum_{j=1..n} prime(j)*2^(j-2). 3

%I #26 Jun 25 2022 00:51:28

%S 1,4,14,42,130,338,882,2098,5042,12466,28338,66226,150194,326322,

%T 711346,1579698,3513010,7510706,16292530,34904754,73177778,156015282,

%U 330078898,703371954,1517066930,3211565746,6667672242,13848320690,28478053042,58811259570

%N a(n) = Sum_{j=1..n} prime(j)*2^(j-2).

%H G. C. Greubel, <a href="/A135483/b135483.txt">Table of n, a(n) for n = 1..1000</a>

%t Table[Sum[2^(i-2) * Prime[i], {i, 1, n}], {n, 1, 10}] (* _G. C. Greubel_, Oct 15 2016 *)

%t Accumulate[Table[Prime[i]*2^(i-2),{i,30}]] (* _Harvey P. Dale_, Aug 14 2019 *)

%o (PARI) a(n) = sum(k=1, n, prime(k)*2^(k-2)); \\ _Michel Marcus_, Oct 15 2016

%Y Cf. A000040, A000079, A092844, A110299.

%Y Partial sums of A239885.

%K nonn,easy

%O 1,2

%A _Ctibor O. Zizka_, Feb 07 2008

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 25 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)