34528

Appears in sequences

• Triangle read by rows: T(n,k) is the number of hill-free Schroeder paths of length 2n that have k returns to the x-axis (0<=k<=floor(n/2)). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A hill is a peak at height 1.at n=33A114692
• Number of arrays of 4 integers in -n..n with sum zero and adjacent elements differing in absolute value.at n=18A202964
• a(n) = A216960(n)/2.at n=34A216961
• Number of tilings of an n X n square using right trominoes and at most one monomino.at n=7A233807
• Sum of divisors of n and product of divisors of n are both perfect cubes.at n=8A244428
• Number of ways to split a strict integer partition of n into consecutive subsequences with strictly decreasing sums.at n=47A318684
• Number of minimum dominating sets in the n X n grid graph.at n=14A347632
• Number of numbers with sum of digits n in fractional base 4/3.at n=50A364780