login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A228763 a(n) = 2^L(n) - 1, where L(n) is the n-th Lucas number (A000032). 0
3, 1, 7, 15, 127, 2047, 262143, 536870911, 140737488355327, 75557863725914323419135, 10633823966279326983230456482242756607, 803469022129495137770981046170581301261101496891396417650687 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..11.

FORMULA

a(n) = a(n-1) + a(n-2) + a(n-1) * a(n-2) for n>1, a(0)=3, a(1)=1.

MATHEMATICA

Table[2^LucasL[n] - 1, {n, 0, 15}] (* Bruno Berselli, Sep 03 2013 *)

PROG

(MAGMA) [2^Lucas(n)-1: n in [0..15]]; // Bruno Berselli, Sep 03 2013

(PARI) a(n)=2^(fibonacci(n-1)+fibonacci(n+1))-1 \\ Charles R Greathouse IV, Sep 03 2013

CROSSREFS

Cf. A000032, A063896.

Sequence in context: A218810 A218638 A232295 * A101845 A193606 A221328

Adjacent sequences:  A228760 A228761 A228762 * A228764 A228765 A228766

KEYWORD

nonn

AUTHOR

Yeshwant Shivrai Valaulikar, Sep 03 2013

EXTENSIONS

More terms from Bruno Berselli, Sep 03 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 18 10:19 EDT 2021. Contains 343995 sequences. (Running on oeis4.)