login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A262714 a(0) = a(1) = 2; for n>1, a(n) = a(n-1)*a(n-2) + 1. 0
2, 2, 5, 11, 56, 617, 34553, 21319202, 736642386707, 15704627843968647815, 11568694537326272321321120595206, 181682042349262169758803442669575561298555791374891, 2101824050856189730969091901210449068013789839106586804501928241686514359003372547 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

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

MATHEMATICA

RecurrenceTable[{a[0] == a[1] == 2, a[n] == a[n - 1] a[n - 2] + 1}, a, {n, 0, 20}]

PROG

(MAGMA) [n le 2 select 2 else Self(n-1)*Self(n-2)+1: n in [1..11]];

(PARI) a(n) = if(n<2, 2, 1 + a(n-1)*a(n-2))

vector(30, n, a(n-1)) \\ Altug Alkan, Sep 30 2015

(PARI) {a(n) = if( n<2, 2 * (n>=0), self()(n-1) * self()(n-2) + 1)}; /* Michael Somos, Oct 02 2015 */

CROSSREFS

Cf. A007660, A055937.

Sequence in context: A227999 A049680 A153983 * A058021 A152445 A077182

Adjacent sequences:  A262711 A262712 A262713 * A262715 A262716 A262717

KEYWORD

nonn,easy

AUTHOR

Vincenzo Librandi, Sep 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 25 22:17 EDT 2019. Contains 323576 sequences. (Running on oeis4.)