155925

Appears in sequences

• Denominators in the Taylor series for tan(x).at n=5A036279
• Denominators of Taylor series for tan(x + Pi/4).at n=11A046983
• Largest odd divisor of n!.at n=11A049606
• Denominators of the coefficients in exp(2x/(1-x)) power series.at n=10A067655
• Numbers k such that core(k) = b(k,1)*b(k,0) where b(k,1) is the number of 1's in binary representation of k, b(k,0) the number of 0's and core(k) the squarefree part of k.at n=15A071639
• a(n) = smallest number which can be expressed as sum of d consecutive positive integers in exactly n ways (where d>0 is a divisor of the number).at n=32A082637
• Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by A001147(n).at n=23A085881
• Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by A001147(n).at n=25A085881
• n = k^2 - (reversal of k)^2 for two different values of k.at n=12A087672
• a(n) = gcd(n!!, (n-1)!!) where n!! = A006882.at n=22A095987
• a(n) = gcd(n!!, (n-1)!!) where n!! = A006882.at n=23A095987
• Denominators of the coefficients in the Taylor expansion of sec(x) + tan(x) around x=0.at n=11A099617
• From the game of Quod: number of "squares" on an n X n array of points with the four corner points deleted.at n=35A124479
• Smallest n such that pi(n)=Floor[n/log((n-pi(n))/e)].at n=24A135325
• a(0)=1, a(n) = largest divisor of n! that is coprime to a(n-1).at n=11A135354
• There are 4*n players who wish to play bridge at n tables. Each player must have another player as partner and each pair of partners must have another pair as opponents. The choice of partners and opponents can be made in exactly a(n)=(4*n)!/(n!*8^n) different ways.at n=3A139541
• Numbers with exactly 4 distinct odd prime divisors {3,5,7,11}.at n=23A147577
• a(n) = denominator(2^(2*n-2)/factorial(2*n-1)).at n=5A156769
• Denominator of Laguerre(n, -8).at n=11A160604
• Denominator of Laguerre(n, -2).at n=11A160616