The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #4 May 23 2024 00:53:34
%S 11,13,145,20737,429981697,184884258895036417,
%T 34182189187166852111368841966125057,
%U 1168422057627266461843148138873451659428421700563161428957815831003137
%N 11 followed by the Fermat numbers A152585.
%C If a(0)=3, the recursion formula gives A000215.
%F a(0)=11. a(n)= 2 + Product_{i=0..n-1} a(i).
%t a[0] := 11;
%t a[n_] := a[n] = Product[a[i], {i, 0, n - 1}] + 2;
%t Table[a[n], {n, 0, 10}]
%Y Cf. A000215, A178427, A178428.
%K nonn,less
%O 0,1
%A _Roger L. Bagula_, May 27 2010
%E Definition simplified by the Assoc. Eds. of the OEIS - May 28 2010