19619

Appears in sequences

• Number of partitions of n into parts not of the form 25k, 25k+8 or 25k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=37A036007
• Gaps of 2 in sequence A038593 (lower terms).at n=18A038643
• a(n) = a(n-2) - (n-1)*a(n-3), with a(0) = 0, a(1) = 1, a(2) = 2.at n=16A122021
• Monotonic ordering of nonnegative differences 3^i-4^j, for 40>= i>=0, j>=0.at n=37A192147
• Monotonic ordering of nonnegative differences 3^i-8^j, for 40>= i>=0, j>=0.at n=27A192155
• Number of nX4 0..2 arrays with no element equal to the same number of vertical neighbors as horizontal neighbors, with new values 0..2 introduced in row major order.at n=4A241135
• Number of nX5 0..2 arrays with no element equal to the same number of vertical neighbors as horizontal neighbors, with new values 0..2 introduced in row major order.at n=3A241136
• T(n,k)=Number of nXk 0..2 arrays with no element equal to the same number of vertical neighbors as horizontal neighbors, with new values 0..2 introduced in row major order.at n=31A241138
• T(n,k)=Number of nXk 0..2 arrays with no element equal to the same number of vertical neighbors as horizontal neighbors, with new values 0..2 introduced in row major order.at n=32A241138
• Number of partitions p of n such that ceiling(mean(p)) is a part and floor(mean(p)) is not.at n=48A241341
• Expansion of Product_{k>=1} (1 + x^(2*k-1))^k.at n=38A263140
• a(n) is the least k such that A295520(k) = n.at n=46A295793
• a(n) = Sum_{k=0..n} (-1)^(n-k) * k^(k*n).at n=3A349891
• a(n) is the number of reducible monic cubic polynomials x^3 + r*x^2 + s*x + t with integer coefficients bounded by naïve height n (abs(r), abs(s), abs(t) <= n).at n=36A358398