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.
%I A089835 #7 May 18 2024 14:51:53 %S A089835 1,2,24,600,23520,1270080,87816960,7420533120,742053312000, %T A089835 85781362867200,11260753452748800,1655330757554073600, %U A089835 269436914075724595200,48113734656379392000000 %N A089835 a(n) = (A000108(n)^2)*(n+1)!. %C A089835 This sequence gives the total number of non-recursive "clauses" of n opening nodes, used in the construction of A089840. %F A089835 a(n) = A001246(n)*A000142(n+1) = A001813(n)*A000108(n). %o A089835 (MIT/GNU Scheme) (define (A089835 n) (* (A000108 n) (A000108 n) (A000142 (1+ n)))) %Y A089835 INVERTi transform of A089836. %Y A089835 Cf. A000108, A000142, A001246, A001813. %K A089835 nonn %O A089835 0,2 %A A089835 _Antti Karttunen_, Dec 05 2003