36248

Appears in sequences

• a(n) = a(n-1) + a(n-3), with a(0) = a(1) = 1, a(2) = 5.at n=26A011761
• Number of trees with n nodes and 7 leaves.at n=11A055294
• Number of orbits in A002619 consisting of n permutations.at n=9A064852
• Third convolution of A000129(n+1) (generalized (2,1)-Fibonacci, called Pell numbers), n>=0, with itself.at n=7A073380
• Number of binary trees (each vertex has 0, or 1 left, or 1 right, or 2 children) with n edges and having all leaves at the same level.at n=12A106376
• Rectangular table, read by antidiagonals, such that the g.f. of row n, R_n(y), satisfies: R_n(y) = [ Sum_{k>=0} y^k * R_k(y)^n ]^n for n>=0, with R_0(y) = 1.at n=61A124540
• Row 4 of rectangular table A124540; equals the self-convolution 4th power of A124534 (row 4 of table A124530).at n=6A124544
• Triangle read by rows: let t1(n,k)=Sum[(-1)^j Binomial[n + 1, j](k + 1 - j)^n, {j, 0, k + 1}]; then T(n,m)=2*t1(n + 1, k) - (m! - n! + (-m + n)!).at n=31A155452
• Triangle read by rows: let t1(n,k)=Sum[(-1)^j Binomial[n + 1, j](k + 1 - j)^n, {j, 0, k + 1}]; then T(n,m)=2*t1(n + 1, k) - (m! - n! + (-m + n)!).at n=32A155452
• Chocolate dove bar numerator: a(n) = (Sum_{k=0..floor(n/2)} k*binomial(n+k,k)*binomial(n,n-2*k)) + (Sum_{k=0..ceiling(n/2)} k*binomial(n+k-1,k-1)*binomial(n,n-2*k+1)).at n=8A167660
• Numbers n such that Bernoulli number B_{n} has denominator 1410.at n=44A272369
• Table read by antidiagonals: T(h,n) is the number of n-step self avoiding walks on a 3D cubic lattice confined inside a box of size 2h x 2h x 2h where the walk starts at the center of one of the box's faces.at n=45A337031
• The number of n-step self avoiding walks on a 3D cubic lattice confined inside a box of size 2x2x2 where the walk starts at the center of one of the box's faces.at n=10A337033