cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A076793 a(n) = Sum_{k=1..n} 2^prime(k).

This page as a plain text file.
%I A076793 #21 Jul 17 2022 08:02:30
%S A076793 0,4,12,44,172,2220,10412,141484,665772,9054380,545925292,2693408940,
%T A076793 140132362412,2339155617964,11135248640172,151872736995500,
%U A076793 9159071991736492,585619824295159980,2891462833508853932,150465415423185266860,2511648656858007873708
%N A076793 a(n) = Sum_{k=1..n} 2^prime(k).
%C A076793 a(468) has 1000 decimal digits. - _Michael De Vlieger_, Jul 14 2017
%H A076793 Michael De Vlieger, <a href="/A076793/b076793.txt">Table of n, a(n) for n = 0..467</a>
%F A076793 a(n) = a(n-1) + 2^prime(n).
%e A076793 a(1) = 2^prime(1) = 2^2 = 4; a(2) = 4 + 2^prime(2) = 4 + 2^3 = 12.
%t A076793 Table[Sum[2^Prime[k], {k, n}], {n, 0, 18}] (* _Michael De Vlieger_, Jul 14 2017 *)
%o A076793 (PARI) a(n) = sum(k=1, n, 2^prime(k)) \\ _Michel Marcus_, Jul 23 2013
%Y A076793 Cf. A000040, A076794.
%Y A076793 Partial sums of A034785.
%K A076793 easy,nonn
%O A076793 0,2
%A A076793 _Walter Carlini_, Nov 17 2002
%E A076793 More terms from _R. J. Mathar_, Aug 31 2007