The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #7 May 18 2024 14:51:53
%S 1,2,24,600,23520,1270080,87816960,7420533120,742053312000,
%T 85781362867200,11260753452748800,1655330757554073600,
%U 269436914075724595200,48113734656379392000000
%N a(n) = (A000108(n)^2)*(n+1)!.
%C This sequence gives the total number of non-recursive "clauses" of n opening nodes, used in the construction of A089840.
%F a(n) = A001246(n)*A000142(n+1) = A001813(n)*A000108(n).
%o (MIT/GNU Scheme) (define (A089835 n) (* (A000108 n) (A000108 n) (A000142 (1+ n))))
%Y INVERTi transform of A089836.
%Y Cf. A000108, A000142, A001246, A001813.
%K nonn
%O 0,2
%A _Antti Karttunen_, Dec 05 2003