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!)
A005607 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_

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 March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)