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 A375406 #11 Aug 23 2024 08:40:32 %S A375406 0,0,0,0,0,0,1,4,14,41,110,278,673,1576,3599,8055,17732,38509,82683, %T A375406 175830,370856,776723,1616945,3348500,6902905,14174198,29004911, %U A375406 59175625,120414435,244468774,495340191,1001911626,2023473267,4081241473,8222198324,16548146045,33276169507 %N A375406 Number of integer compositions of n that match the dashed pattern 3-12. %C A375406 First differs from the non-dashed version A335514 at a(9) = 41, A335514(9) = 42, due to the composition (3,1,3,2). %C A375406 Also the number of integer compositions of n whose leaders of weakly decreasing runs are not weakly increasing. For example, the composition q = (1,1,2,1,2,2,1,3) has maximal weakly decreasing runs ((1,1),(2,1),(2,2,1),(3)), with leaders (1,2,2,3), which are weakly increasing, so q is not counted under a(13); also q does not match 3-12. On the other hand, the reverse is (3,1,2,2,1,2,1,1), with maximal weakly decreasing runs ((3,1),(2,2,1),(2,1,1)), with leaders (3,2,2), which are not weakly increasing, so it is counted under a(13); meanwhile it matches 3-12, as required. %H A375406 Wikipedia, <a href="https://en.wikipedia.org/wiki/Permutation_pattern">Permutation pattern</a>. %H A375406 Gus Wiseman, <a href="/A374629/a374629.txt">Sequences counting and ranking compositions by their leaders (for six types of runs)</a>. %F A375406 a(n>0) = 2^(n-1) - A188900(n). %e A375406 The a(0) = 0 through a(8) = 14 compositions: %e A375406 . . . . . . (312) (412) (413) %e A375406 (1312) (512) %e A375406 (3112) (1412) %e A375406 (3121) (2312) %e A375406 (3122) %e A375406 (3212) %e A375406 (4112) %e A375406 (4121) %e A375406 (11312) %e A375406 (13112) %e A375406 (13121) %e A375406 (31112) %e A375406 (31121) %e A375406 (31211) %t A375406 Table[Length[Select[Join@@Permutations/@IntegerPartitions[n], !LessEqual@@First/@Split[#,GreaterEqual]&]],{n,0,15}] %t A375406 - or - %t A375406 Table[Length[Select[Join@@Permutations/@IntegerPartitions[n], MatchQ[#,{___,z_,___,x_,y_,___}/;x<y<z]&]],{n,0,15}] (*3-12*) %Y A375406 For leaders of identical runs we have A056823. %Y A375406 The complement is counted by A188900. %Y A375406 The non-dashed version is A335514, ranks A335479. %Y A375406 Ranks are positions of non-weakly increasing rows in A374740. %Y A375406 A003242 counts anti-run compositions, ranks A333489. %Y A375406 A011782 counts compositions. %Y A375406 Counting compositions by number of runs: A238130, A238279, A333755. %Y A375406 A373949 counts compositions by run-compressed sum, opposite A373951. %Y A375406 Cf. A106356, A188920, A189076, A189077, A238343, A333213, A335548, A374629, A374637, A374679, A374748. %K A375406 nonn %O A375406 0,8 %A A375406 _Gus Wiseman_, Aug 22 2024