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

A089835
a(n) = (A000108(n)^2)*(n+1)!.
5
1, 2, 24, 600, 23520, 1270080, 87816960, 7420533120, 742053312000, 85781362867200, 11260753452748800, 1655330757554073600, 269436914075724595200, 48113734656379392000000
OFFSET
0,2
COMMENTS
This sequence gives the total number of non-recursive "clauses" of n opening nodes, used in the construction of A089840.
FORMULA
a(n) = A001246(n)*A000142(n+1) = A001813(n)*A000108(n).
PROG
(MIT/GNU Scheme) (define (A089835 n) (* (A000108 n) (A000108 n) (A000142 (1+ n))))
CROSSREFS
INVERTi transform of A089836.
Sequence in context: A090316 A128578 A186632 * A210909 A009251 A009447
KEYWORD
nonn
AUTHOR
Antti Karttunen, Dec 05 2003
STATUS
approved