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.

A073856 a(1) = 1, then the smallest n-th power not included earlier such that each partial sum is a prime.

Original entry on oeis.org

1, 4, 8, 16, 32, 4096, 279936, 656100000000, 19683000000000, 3656158440062976, 36028797018963968, 417030640378345864542952820736, 6502111422497947648, 329539482806454424642350193846115106816, 24066838317339048730709164032
Offset: 1

Views

Author

Amarnath Murthy, Aug 15 2002

Keywords

Crossrefs

Cf. A073857.

Programs

  • Maple
    R:= 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; S:= S union {v}; s:= s+v;   fi;
    od od:
    R; # Robert Israel, Sep 27 2024

Extensions

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 24 2003