97520

Appears in sequences

• Number of points on surface of 4-dimensional cube.at n=23A008511
• a(n) = Sum_{k=0..floor(n/4)} binomial(n-2k, 2k)*2^(n-4k).at n=14A100131
• A Pell convolution.at n=14A113727
• Triangle read by rows: T(n,k) is the number of binary trees (i.e., a rooted tree where each vertex has either 0, 1, or 2 children; and, when only one child is present, it is either a right child or a left child) with n edges and k pairs of adjacent vertices of outdegree 2.at n=27A126219
• Number of binary trees (i.e., rooted trees where each vertex has either 0, 1, or 2 children; and, when only one child is present, it is either a right child or a left child) with n edges and no adjacent vertices of outdegree 2.at n=11A126220
• Number of (n+1)X(3+1) arrays of permutations of 0..n*4+3 with each element having directed index change 0,0 0,1 1,0 -1,0 or 0,-2.at n=3A264212
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,0 0,1 1,0 -1,0 or 0,-2.at n=18A264217
• Number of (4+1)X(n+1) arrays of permutations of 0..n*5+4 with each element having directed index change 0,0 0,1 1,0 -1,0 or 0,-2.at n=2A264221