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.

Showing 1-2 of 2 results.

A073857 a(1) = 1, a(n) = prime obtained as a partial sum of A073856.

Original entry on oeis.org

1, 5, 13, 29, 61, 4157, 284093, 656100284093, 20339100284093, 3676497540347069, 39705294559311037, 417030640378385569837512131773, 417030640384887681260010079421, 329539483223485065027237875106125186237
Offset: 1

Views

Author

Amarnath Murthy, Aug 15 2002

Keywords

Crossrefs

Cf. A073856.

Programs

  • Maple
    B:= 1: S:= {1}: s:= 1:
    for n from 2 to 20 do
      for k from 2 do
        v:= k^n;
        if member(v,S) then next fi;
        if isprime(s+v) then R:= R,v; B:= B, s+v; S:= S union {v}; s:= s+v; fi;
    od od:
    B; # Robert Israel, Sep 27 2024

Extensions

More terms from R. J. Mathar, Jun 27 2007

A239280 Powers of 2 that are sum of prime(k) + k for some k.

Original entry on oeis.org

8, 16, 32, 4096
Offset: 1

Views

Author

Zak Seidov, Mar 14 2014

Keywords

Comments

a(5) > 2^47. - Giovanni Resta, Mar 14 2014
a(5) > 2^62 if it exists. - Chai Wah Wu, Apr 28 2018

Examples

			3 + prime(3) = 8 = 2^3.
5 + prime(5) = 16 = 2^4.
9 + prime(9) = 32 = 2^5.
503 + prime(503) = 4096 = 2^12.
		

Crossrefs

Showing 1-2 of 2 results.