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!)
A254429 a(0) = 0; for n >= 0, a(n+1) = 2^a(n) + 1. 2
0, 2, 5, 33, 8589934593 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n+1) = A000051(a(n)). - Reinhard Zumkeller, Jan 31 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 *)
PROG
(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
CROSSREFS
Cf. A000051.
Sequence in context: A208985 A333738 A114793 * A298945 A027303 A357446
KEYWORD
nonn
AUTHOR
Max Alekseyev, Jan 30 2015
STATUS
approved

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 September 6 19:40 EDT 2024. Contains 375718 sequences. (Running on oeis4.)