62368

Appears in sequences

• a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026703.at n=14A026711
• Triangle of coefficients of generating function of 4-ary rooted trees of height at most n.at n=58A036606
• Number of 4-ary rooted trees with n nodes and height at most 4.at n=27A036609
• Number of 4-ary rooted trees with n nodes and height exactly 4.at n=27A036628
• Let f(n) = minimum of average number of comparisons needed for any sorting method for n elements and let g(n) = n!*f(n). Sequence gives a lower bound on g(n).at n=6A117627
• Number of nX7 binary arrays with top left value 1 and no two ones adjacent horizontally, diagonally or antidiagonally.at n=3A228659
• T(n,k)=Number of nXk binary arrays with top left value 1 and no two ones adjacent horizontally, diagonally or antidiagonally.at n=48A228660
• Number of 4 X n binary arrays with top left value 1 and no two ones adjacent horizontally, diagonally or antidiagonally.at n=6A228663