18190

Appears in sequences

• Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 8 sites wide.at n=46A058365
• a[n] =a[n-1] + 2*n*Prime[n]-n^2.at n=20A093809
• Values of y in solutions (x,y,z) to the Diophantine equation x^3-x^2+y^3-y^2=z^3-z^2, with 1<x<y<z arranged in order of increasing x.at n=25A138668
• The number of planar partitions of n with adjacent parts differing by no more than 1.at n=21A252479
• G.f.: (1 + x^4 + x^5 + x^6 + x^10 + x^11 + x^12 + x^16)/Product_{i=1..8} (1 - x^i).at n=36A256975
• Number of (n+1)X(n+1) 0..1 arrays with each row divisible by 3 and each column divisible by 7, read as a binary number with top and left being the most significant bits.at n=4A262911
• Number of (n+1)X(5+1) 0..1 arrays with each row divisible by 3 and each column divisible by 7, read as a binary number with top and left being the most significant bits.at n=4A262914
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each row divisible by 3 and each column divisible by 7, read as a binary number with top and left being the most significant bits.at n=40A262917
• Number of (5+1)X(n+1) 0..1 arrays with each row divisible by 3 and each column divisible by 7, read as a binary number with top and left being the most significant bits.at n=4A262919
• Expansion of 1/(1 - Sum_{k>=2} floor(1/omega(k))*x^k), where omega(k) is the number of distinct prime factors (A001221).at n=24A280195
• Number of compositions (ordered partitions) of n into parts with an odd number of distinct prime divisors.at n=24A286224
• Number of nX6 0..1 arrays with every element equal to 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=22A298185