login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005607 a(n) = (a(n-1) + a(n-2))!. 11
1, 1, 2, 6, 40320 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

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

LINKS

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

J. T. Butler, Fanout-free networks of multivalued gates, Proc. Internat. Symposium Multiple-Valued Logic, Charlotte NC, 1977. IEEE Press, NY, 1977, pp. 39-46. (Annotated scanned copy)

J. T. Butler, Letter to N. J. A. Sloane, Dec. 1978

CROSSREFS

Sequence in context: A121167 A115658 A337096 * A184391 A161563 A135408

Adjacent sequences:  A005604 A005605 A005606 * A005608 A005609 A005610

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 1 16:44 EST 2021. Contains 349430 sequences. (Running on oeis4.)