21344

Appears in sequences

• Self-convolution of (1, p(1), p(2), ...).at n=25A023626
• a(n) = A050314(2n+1,1): column 1 of triangle.at n=25A050316
• Number of (directed) Hamiltonian paths in the 3 X n knight graph.at n=10A118067
• a(n) = n*(n+1)*(5*n+1)/3.at n=23A174814
• Number of 3:4:5 proportioned triangles on a (n+1)X(n+1) grid.at n=22A189972
• a(n) = 8*a(n-1) - 6*a(n-2), with a(0)=0, a(1)=1.at n=6A190978
• The Wiener index of the double-comb graph \/_\/_\/...\/_\/ with 3n (n>=1) nodes. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices in the graph.at n=22A192025
• Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,0,1,4,2 for x=0,1,2,3,4.at n=6A196295
• Number of nX7 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,0,1,4,2 for x=0,1,2,3,4.at n=2A196299
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,0,1,4,2 for x=0,1,2,3,4.at n=38A196300
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,0,1,4,2 for x=0,1,2,3,4.at n=42A196300
• Triangle of coefficients of polynomials v(n,x) jointly generated with A209141; see the Formula section.at n=48A209142
• Triangle of coefficients of polynomials v(n,x) jointly generated with A209745; see the Formula section.at n=51A209746
• Number of (w,x,y) with all terms in {0,...,n} and 2*|w-x| > max(w,x,y) - min(w,x,y).at n=31A213045
• Number of (n+1) X (1+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant-stress 1 X 1 tilings).at n=2A234452
• Number of (n+1) X (3+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant-stress 1 X 1 tilings).at n=0A234454
• T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant-stress 1 X 1 tilings).at n=3A234458
• T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant-stress 1 X 1 tilings).at n=5A234458
• Number of partitions of n with difference -10 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=40A242682
• Expansion of x*(1+7*x-6*x^3)/(1-8*x^2+6*x^4).at n=10A249310