25515

Appears in sequences

• Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^10 in powers of x.at n=22A001488
• Hadamard maximal determinant problem: largest determinant of a (real) {0,1}-matrix of order n.at n=14A003432
• Triangle of coefficients in expansion of (1+9x)^n.at n=31A013616
• Triangle of coefficients in expansion of (3+5x)^n.at n=29A013622
• Every prefix prime in base 6 (written in base 6).at n=27A024766
• Triangle whose (i,j)-th entry is binomial(i,j)*5^(i-j)*3^j.at n=34A038245
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*1^j.at n=32A038291
• Least number with exactly n odd divisors.at n=27A038547
• Odd numbers divisible by exactly 8 primes (counted with multiplicity).at n=5A046321
• Denominators of power series coefficients of a(x) satisfying a(a(a(x)))= arctan(x).at n=3A052137
• Invert transform applied twice to Pascal's triangle A007318.at n=31A055373
• Invert transform applied twice to Pascal's triangle A007318.at n=32A055373
• Exponential transform of Stirling2 triangle A008277.at n=31A055896
• a(n) = A061680(n!).at n=36A069785
• Group successively larger prime numbers so that the sum of the n-th group is a multiple of n. Sequence gives the sum for each group.at n=20A074128
• Binomial transform of n^2*2^n/2.at n=6A077616
• Denominators of partial sums of series for 3*arctanh(1/3) = (3/2)*log(2).at n=3A096950
• Triangle read by rows: T(n,k) = (-1)^k*3^(n-1-2k)*binomial(n-k,k)*(4n-5k)/(n-k) (0 <= k <= floor(n/2), n >= 1).at n=32A104063
• Smallest m such that the m-th Fibonacci number has exactly n divisors that are also Fibonacci numbers.at n=27A105802
• Numbers that have exactly eight prime factors counted with multiplicity (A046310) whose digit reversal is different and also has 8 prime factors (with multiplicity).at n=1A109028