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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #3 Mar 30 2012 17:34:41
%S 29,31,901,810001,656100000001,430467210000000000000001,
%T 185302018885184100000000000000000000000000000001,
%U 34336838202925124846578490892810000000000000000000000000000000000000000000000000000000000000001
%N 29 followed by the base-30 Fermat numbers.
%F a(n)= 30^(2^(n-1))+1, n>0.
%F a(n)= 2+ product_{i<n} a(i).
%F a(n)= 1 + (a(n-1)-1)^2, n>1.
%t Clear[a, n];
%t a[0] := 29;
%t a[n_] := a[n] = Product[a[i], {i, 0, n - 1}] + 2;
%t Table[a[n], {n, 0, 10}]
%Y Cf. A000215
%K nonn,easy
%O 0,1
%A _Roger L. Bagula_, May 27 2010
%E Edited by the Assoc. Eds. of the OEIS, Jul 20 2010