18326

Appears in sequences

• Number of protruded partitions of n with largest part at most 10.at n=15A005116
• Number of unlabeled trivalent 3-connected bipartite planar graphs with 2n nodes without subgraphs R2 and R4.at n=16A007084
• a(n) = number of (s(0),s(1),...,s(n)) such that every s(i) is a nonnegative integer, s(0) = 1, s(n) = 5, |s(1) - s(0)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2. Also a(n) = T(n,n-4), where T is the array in A026120.at n=8A026126
• Triangle read by rows in which row n gives coefficients of polynomial R_n(y) that satisfies R_n(1/2) = 8^n, where R_n(y) forms the initial (n+1) terms of g.f. A097182(y)^(n+1).at n=24A097181
• a(n) = (n-1)*(n+4)*(n+6)/6 for n > 1, a(1)=1.at n=44A137742
• a(n) = 2^(n^2+n) * C(n-1 + 1/2^n, n) = [x^n] 1/(1 - 2^(n+1)*x)^(1/2^n).at n=4A159558
• Number of ways to place 2 nonattacking knights on an n X n toroidal board.at n=13A172529
• Number of ways to place 2 nonattacking kings on an n X n toroidal board.at n=13A179403
• Expansion of g.f. 1/(1 - 32*x)^(1/16).at n=4A224882
• a(n) = (n-4)*(n+1)*(n+3)/6.at n=44A275874
• Sum of the odd parts in the partitions of n into 9 parts.at n=33A309657
• a(n+1) = Sum_{k=1..n} (a(k) + k*(n-k)), with a(1)=1.at n=12A335927
• Expansion of A(x) satisfying [x^n] A(x) / (1 + x*A(x)^(n+1)) = 0 for n > 0.at n=6A360583
• Records in A390108.at n=11A390454