24318

Appears in sequences

• Number of partitions satisfying cn(0,5) < cn(1,5) + cn(4,5) + cn(2,5) and cn(0,5) < cn(1,5) + cn(4,5) + cn(3,5).at n=37A039846
• Expansion of (1 + 4*x + 14*x^2 + 34*x^3 + 63*x^4 + 80*x^5 + 87*x^6 + 68*x^7 + 42*x^8 + 20*x^9 + 7*x^10) / ((1 - x)*(1 - x^2)^2*(1 - x^3)^2*(1 - x^4)).at n=14A055384
• Consider the sequence {b(m)} of composite numbers (excluding 1); sequence gives values of b(m) where gcd(m, b(m)) increases.at n=28A058012
• a(n) = 6*a(n-1) + 3*a(n-2), a(0)=2, a(1)=14.at n=5A109113
• a(n) = 8*n^4+44*n^3+106*n^2+100*n+30.at n=7A129029
• Number of (w,x,y,z) with all terms in {1,...,n} and |x-y| = w + |y-z|.at n=37A212683
• Number of nX4 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nX4 array.at n=7A219911
• Boustrophedon transform of Thue-Morse sequence A010060.at n=9A230950
• Number of partitions p of n such that m(p) < m(c(p)), where m = maximal multiplicity of parts, and c = conjugate.at n=41A240726
• (1/9) times the sum of the elements of all subsets of [n] whose sum is divisible by nine.at n=15A309301
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A384943.at n=61A384946