cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A089835 a(n) = (A000108(n)^2)*(n+1)!.

Original entry on oeis.org

1, 2, 24, 600, 23520, 1270080, 87816960, 7420533120, 742053312000, 85781362867200, 11260753452748800, 1655330757554073600, 269436914075724595200, 48113734656379392000000
Offset: 0

Views

Author

Antti Karttunen, Dec 05 2003

Keywords

Comments

This sequence gives the total number of non-recursive "clauses" of n opening nodes, used in the construction of A089840.

Crossrefs

INVERTi transform of A089836.
Cf. A000108, A000142, A001246, A001813.

Formula

a(n) = A001246(n)*A000142(n+1) = A001813(n)*A000108(n).
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.