27110

Appears in sequences

• Number of (0,1)-strings of length n that avoid the substrings of substrings 11101011 and 101111.at n=15A062259
• Number of ways to place 8 nonattacking amazons (superqueens) on an 8 X n board.at n=12A178372
• Number of nX4 0..1 arrays with every element unequal to 0, 1, 2, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=6A305638
• Number of nX7 0..1 arrays with every element unequal to 0, 1, 2, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=3A305641
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=48A305642
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=51A305642
• Number of permutations p of [n] such that |p(i) - p(i-1)| is in {2,7} for all i from 2 to n.at n=29A328648
• The sum of the weights of the stones-and-bones tilings of the (n,2n-3)-benzel, where each stone is given multiplicative weight 3.at n=2A364438
• Triangle read by rows: T(n,k) is the number of sequences in which the games of a single-elimination tournament with n teams can be played if arbitrarily many arenas are available, the tournament bracket is chosen to the bracket with the largest such number of sequences, and the number of distinct times at which games are played is k, log_2(n) <= k <= n-1.at n=61A378855
• Expansion of (1/x) * Series_Reversion( x * (1 - x) / (1 + x^3 / (1 - x)^3) ).at n=9A389411