20942

Appears in sequences

• Number of partitions of n with at most two even parts.at n=45A096778
• Number of strings of numbers x(i=1..n) in 0..5 with sum i^3*x(i) equal to n^3*5.at n=10A184253
• G.f. satisfies: A(x) = 1 + x*A(x)^3*A(-x)*A(I*x)*A(-I*x).at n=9A214374
• Number of partitions of n+8 with largest inscribed rectangle having area <= n.at n=29A218629
• Number of length n+6 0..2 arrays with no seven consecutive terms having the maximum of any three terms equal to the minimum of the remaining four terms.at n=6A249877
• T(n,k)=Number of length n+6 0..k arrays with no seven consecutive terms having the maximum of any three terms equal to the minimum of the remaining four terms.at n=34A249883
• Number of length 7+6 0..n arrays with no seven consecutive terms having the maximum of any three terms equal to the minimum of the remaining four terms.at n=1A249890
• a(n) = n-th pi-based antiderivative of 8.at n=21A259169
• Smallest number k such that k*(2^(2*A000043(n))-1)+1 is prime.at n=22A268175
• G.f. A(x) satisfies: -1 = Product_{n>=1} (1 - A(x)^n) * (1 - A(x)^n/x) * (1 - A(x)^(n-1)*x).at n=4A268299
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 310", based on the 5-celled von Neumann neighborhood.at n=37A271198
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 406", based on the 5-celled von Neumann neighborhood.at n=40A271772