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!)
A239899 a(0)=2, a(1)=5; thereafter a(n) = product of all preceding terms, minus 1. 0
2, 5, 9, 89, 8009, 64152089, 4115490587216009, 16937262773463574696951813104089 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
Robert Munafo, Some integer sequences
FORMULA
a(n) == 8 mod 9, for n > 2. - Ivan N. Ianakiev, Apr 06 2014
a(n) = (a(n-1)+1)*a(n-1)-1, for n > 2. - Zak Seidov, Apr 06 2014
EXAMPLE
(9 + 1)*9 - 1 = 89, (89 + 1)*89 - 1 = 8009, (8009 + 1)*8009 - 1 = 64152089. - Zak Seidov, Apr 06 2014
PROG
(Magma) I:=[2, 5, 9]; [n le 3 select I[n] else Self(n-1)*(Self(n-1)+1)-1: n in [1..10]]; // Vincenzo Librandi, May 22 2014
CROSSREFS
Sequence in context: A334986 A185160 A289942 * A188948 A334295 A083460
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Apr 05 2014
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 10 13:17 EDT 2024. Contains 375790 sequences. (Running on oeis4.)