login

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”).

a(n) = (a(n-1) + a(n-2))!.
11

%I #12 Oct 04 2017 00:03:00

%S 1,1,2,6,40320

%N a(n) = (a(n-1) + a(n-2))!.

%C The next term has 168215 digits and is too large to include.

%H J. T. Butler, <a href="/A005607/a005607.pdf">Fanout-free networks of multivalued gates</a>, Proc. Internat. Symposium Multiple-Valued Logic, Charlotte NC, 1977. IEEE Press, NY, 1977, pp. 39-46. (Annotated scanned copy)

%H J. T. Butler, <a href="/A005607/a005607_1.pdf">Letter to N. J. A. Sloane, Dec. 1978</a>

%K nonn,easy

%O 0,3

%A _N. J. A. Sloane_