33062

Appears in sequences

• Number of ordered rooted trees with n edges having root of odd degree.at n=10A000958
• Numbers that are the sum of 7 nonzero 8th powers.at n=31A003385
• Triangle T(n,k) giving number of hill-free Dyck paths of length 2n and having height of first peak equal to k.at n=55A065602
• Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having exactly k UDU's at low level.at n=55A098747
• Triangle read by rows: T(n,k) is the number of ordered trees with n edges having k even-length branches starting at the root (0<=k<=n).at n=36A127541
• Triangle read by rows: Catalan triangle of the k-Fibonacci sequence.at n=65A236918
• Convolution triangle of A000958(n+1).at n=55A237596
• a(n) = Sum_{k=0..n} (k+1) * binomial(k,4*(n-k)).at n=15A392076
• a(n) = Sum_{k=0..floor(n/2)} (k+1) * binomial(k,2*(n-2*k)).at n=30A392251