19010

Appears in sequences

• Triangle T read by rows: T(m,n) = number of convex polyominoes with an m+1 X n+1 minimal bounding rectangle, m > 0, n <= m.at n=9A093118
• Number of convex polyominoes with an n+1 X n+1 minimal bounding square.at n=3A093120
• a(n) = number of distinct values of Product_{i=1..r} x_i!*i!^x_i, where (x_1, ..., x_r) is an r-tuple of nonnegative integers with Sum_{i=1..r} i*x_i = n.at n=48A102465
• (p*q - 1)/2 where p and q are consecutive odd primes.at n=42A102770
• Numbers k such that 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)*p(k+5)-1 and 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)*p(k+5)+1 are twin primes with p(h) = h-th prime.at n=25A129311
• Number of -n..n arrays x(0..3) of 4 elements with zero sum and nonzero second and third differences.at n=14A200205
• Number of (w,x,y,z) with all terms in {0,...,n} and (least gapsize)<2.at n=13A212896
• Expansion of g.f. 1/((1-x)^2*(1-26*x)).at n=3A229463
• Volume of right regular hexagonal pyramid with height and side lengths n, rounded down.at n=27A234729
• Number of minimal edge covers in the n-gear graph.at n=11A290762
• The number of convex polyominoes whose smallest bounding rectangle has size w*h (w > 0, h > 0). The table is read by antidiagonals.at n=40A324009
• a(n) = 32*n^2 - 40*n + 10.at n=24A343578
• G.f. A(x) satisfies A(x) = 1 + x * A(x/(1 - x)^4) / (1 - x).at n=7A351814