31061

Appears in sequences

• Number of rooted trees with n nodes and 9 leaves.at n=6A055284
• Number of length 5+2 0..n arrays with every three consecutive terms having the sum of some two elements equal to twice the third.at n=29A248438
• Number of n X n 0..1 arrays with every element equal to 1 or 2 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=5A301818
• Number of nX6 0..1 arrays with every element equal to 1 or 2 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=5A301821
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1 or 2 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=60A301823
• Number of 6Xn 0..1 arrays with every element equal to 1 or 2 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=5A301827
• L.g.f.: log(Sum_{k>=0} k! * x^(k*(k + 1)/2) / Product_{j=1..k} (1 - x^j)).at n=24A331337