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.

A254429 a(0) = 0; for n >= 0, a(n+1) = 2^a(n) + 1.

Original entry on oeis.org

0, 2, 5, 33, 8589934593
Offset: 0

Views

Author

Max Alekseyev, Jan 30 2015

Keywords

Crossrefs

Programs

  • Haskell
    a254429 n = a254429_list !! n
    a254429_list = iterate ((+ 1) . (2 ^)) 0
    -- Reinhard Zumkeller, Jan 31 2015
    
  • Magma
    [n le 2 select 2*(n-1) else 2^Self(n-1)+1: n in [1..5]]; // Vincenzo Librandi, Feb 01 2015
  • Mathematica
    RecurrenceTable[{a[0]==0, a[n]==2^a[n-1] + 1}, a, {n, 5}] (* Vincenzo Librandi, Feb 01 2015 *)
    NestList[2^#+1&,0,4] (* Harvey P. Dale, Mar 26 2023 *)

Formula

a(n+1) = A000051(a(n)). - Reinhard Zumkeller, Jan 31 2015