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 A382168 #9 Mar 31 2025 22:30:30 %S A382168 0,0,1,1,1,7,7,17,17,17,38,38,38,74,74,119,119,119,185,185,263,263, %T A382168 263,368,368,368,504,504,657,657,657,847,847,847,1078,1078,1331,1331, %U A382168 1331,1631,1631,1956,1956,1956,2334,2334,2334,2769,2769,3234,3234,3234,3762,3762,4323,4323,4323,4953,4953,4953,5656,5656,6397,6397,6397 %N A382168 Number of triples (i,j,k), 1 <= i < j < k <= n such that A019444(i) < A019444(k) < A019444(j). %C A382168 Counts occurrences of the pattern 132 in A019444. Note that the Catalan numbers (A000108) count permutations of 1,2,...,n that avoid the pattern 132. %Y A382168 Cf. A000108, A019444, A382162, A382169. %K A382168 nonn %O A382168 1,6 %A A382168 _N. J. A. Sloane_, Mar 31 2025