32320

Appears in sequences

• Base-4 numbers whose list of divisors (in base 4) contains each digit 0-3 the same number of times.at n=8A045813
• Numbers k such that Omega(k) = Omega(k+1) + Omega(k+2) + Omega(k+3) + Omega(k+4) where Omega(k) denotes the number of prime factors of k, counting multiplicity.at n=30A078094
• a(n) = binomial(n,4) - binomial(floor(n/2),4) - binomial(ceiling(n/2),4).at n=32A111385
• a(n) = n^5 - n^3 + n^2.at n=8A133071
• 9th column of the array A172119.at n=15A172318
• Number of (w,x,y,z) with all terms in {0,...,n} and |w-x|=max{w,x,y,z}-min{w,x,y,z}.at n=19A212755
• Number of binary words of length n which have no 0^b 1 1 0^a 1 0 1 0^b - matches, where a=0, b=2.at n=15A234590
• Number of partitions p of n such that the number of parts having multiplicity 1 is not a part and max(p) - min(p) is not a part.at n=46A241450
• 9-step Fibonacci sequence starting with 0,0,0,0,0,0,1,0,0.at n=24A251747
• Number of length-n 0..2 arrays with no adjacent pair x,x+1 repeated.at n=9A269650
• a(n) is the sum of the first 2*n nonzero n-bonacci numbers.at n=8A364145
• Number of subsets of {1..n} that can be linearly combined using nonnegative coefficients to obtain n.at n=15A365073
• Number of subsets of {1..n-1} that can be linearly combined using nonnegative coefficients to obtain n.at n=15A365542
• a(n) = 5*n^4 - 6*n^2 + 1. Column 4 of A378066.at n=9A378064