28668

Appears in sequences

• Row sums of A053207.at n=13A053208
• 1/36 the number of (n+2)X6 0..2 arrays with each 3X3 subblock containing two of one value, two of another, and five of the last.at n=4A184452
• 1/36 the number of (n+2)X7 0..2 arrays with each 3X3 subblock containing two of one value, two of another, and five of the last.at n=3A184453
• T(n,k)=1/36 the number of (n+2)X(k+2) 0..2 arrays with each 3X3 subblock containing two of one value, two of another, and five of the last.at n=31A184457
• T(n,k)=1/36 the number of (n+2)X(k+2) 0..2 arrays with each 3X3 subblock containing two of one value, two of another, and five of the last.at n=32A184457
• Partial sums of A200675.at n=50A200678
• Number of 2 X 2 matrices with all elements in {0,1,...,n} and determinant >= 3n.at n=17A210368
• Convolution of (1,-1,2,-2,3,-3,...) and A000045 (Fibonacci numbers).at n=22A213043
• Partial sums of A243980.at n=28A244050
• Number of vertices of type D at level n of the hyperbolic Pascal pyramid PP_(4,5).at n=14A293065
• Number of 4Xn 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=18A301793
• Number of maximal subsets of {1..n} such that every pair of distinct elements has a different quotient.at n=28A325861
• Number of maximal subsets of {1..n} such that every pair of distinct elements has a different quotient.at n=29A325861
• Number of maximal subsets of {1..n} containing n such that every pair of distinct elements has a different quotient.at n=28A325869
• a(n) = A338268(k^2 + 2*n, k) for sufficiently large k.at n=25A338286