24309

Appears in sequences

• Euler characteristics of polytopes.at n=17A006482
• Expansion of (1-x^9 ) / (1-x)^9.at n=9A008491
• a(n) = binomial(2n+1, n+1) - 1.at n=8A010763
• Central binomial coefficient - 1.at n=17A014495
• Numerator of sum of -3rd powers of divisors of n.at n=43A017669
• Number of compositions of n into 9 ordered relatively prime parts.at n=9A023034
• One less than number of n-multisets chosen from a 10-set.at n=8A035927
• Number of nonempty subsets of {1,2,...,n} in which exactly 1/2 of the elements are <= (n-1)/2.at n=17A047171
• Consider the sequence {b(m)} of composite numbers (excluding 1); sequence gives values of b(m) where gcd(m, b(m)) increases.at n=27A058012
• Triangle of generalized Stirling numbers.at n=37A061691
• Moebius transform of A001405 (binomial(n, floor(n/2))).at n=16A062791
• Triangle, read by rows, such that row n equals the inverse binomial transform of row n of table A060543, where A060543(n,k) = C(n+n*k+k, n*k+k).at n=37A108290
• Numbers k such that 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)*p(k+5)-1 and 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)*p(k+5)+1 are twin primes with p(h) = h-th prime.at n=31A129311
• Nine times hexagonal numbers: a(n) = 9*n*(2*n-1).at n=37A152994
• a(n) = binomial(n+8,8) - 1.at n=9A165618
• Ordered differences of numbers s(j)=(1/2)C(2j,j).at n=28A205384
• s(k)-s(j), where (k,j) is the least pair for which n divides s(k)-s(j), and s(j)=(1/2)C(2j,j).at n=36A205390
• Number of permutations p of [n] such that p(i) > p(i+1) iff i == 0 (mod 9).at n=17A250286
• Number T(n,k) of length 2n words such that all letters of the k-ary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting doublets into the initially empty word; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=47A256117
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 302", based on the 5-celled von Neumann neighborhood.at n=43A271158