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!)
A000659 a(n) = 2^a(n-1) + a(n-2). 1

%I #16 Apr 09 2022 11:36:51

%S 0,0,1,2,5,34,17179869189

%N a(n) = 2^a(n-1) + a(n-2).

%C The next term has 5171655948 digits. - _Franklin T. Adams-Watters_, Jul 03 2009

%t Join[{a=0,b=0},Table[c=2^b+a;a=b;b=c,{n,5}]] (* _Vladimir Joseph Stephan Orlovsky_, Apr 13 2011 *)

%t nxt[{a_,b_}]:={b,2^b+a}; NestList[nxt,{0,0},6][[All,1]] (* _Harvey P. Dale_, Apr 09 2022 *)

%Y Cf. A000643.

%K nonn

%O 0,4

%A _N. J. A. Sloane_

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 August 31 19:25 EDT 2024. Contains 375573 sequences. (Running on oeis4.)