login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A178426 11 followed by the Fermat numbers A152585. 2
11, 13, 145, 20737, 429981697, 184884258895036417, 34182189187166852111368841966125057, 1168422057627266461843148138873451659428421700563161428957815831003137 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

If a(0)=3, the recursion formula gives A000215.

LINKS

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

FORMULA

a(0)=11. a(n)= 2+product{i=0..n-1} a(i).

MATHEMATICA

Clear[a, n];

a[0] := 11;

a[n_] := a[n] = Product[a[i], {i, 0, n - 1}] + 2;

Table[a[n], {n, 0, 10}]

CROSSREFS

Cf. A000215, A178427, A178428.

Sequence in context: A108090 A136296 A094621 * A252170 A144375 A140969

Adjacent sequences: A178423 A178424 A178425 * A178427 A178428 A178429

KEYWORD

nonn

AUTHOR

Roger L. Bagula, May 27 2010

EXTENSIONS

Definition simplified by the Assoc. Eds. of the OEIS - May 28 2010

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 December 7 17:25 EST 2022. Contains 358668 sequences. (Running on oeis4.)