27360

Appears in sequences

• Number of strongly triple-free subsets of {1, 2, ..., n}.at n=19A050295
• Expansion of e.g.f. (1-x)/(1-3*x-x^2+x^3).at n=5A052641
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,37.at n=6A064255
• Number of (binary) bit strings of length n in which an odd length block of 0's is followed by an odd length block of 1's.at n=13A065495
• Numbers n such that sopf(sigma(n)) = sigma(sopf(n)), where sopf(x) = sum of the distinct prime factors of x.at n=35A076532
• 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=24A078094
• Triangle, rows = inverse binomial transforms of A073133 columns.at n=32A117936
• Strongly refactorable numbers: numbers n such that if n is divisible by d, it is divisible by the number of divisors of d.at n=32A141586
• First differences of A171733.at n=37A171734
• Numbers with prime factorization pqr^2s^5.at n=9A190293
• Number of conjugacy classes of primitive elements in GF(7^n) which have trace 0.at n=7A192509
• Number of (w,x,y,z) with all terms in {1,...,n} and w>=2x and y<3z.at n=19A212520
• The number of permutations in S_n with strategic pile of size 3.at n=8A267323
• Imaginary part of (n + i)^4.at n=19A272871
• Number of n X 3 0..2 arrays with no element equal to any value at offset (-2,0) (-1,2) or (0,-2) and new values introduced in order 0..2.at n=6A275560
• T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,0) (-1,2) or (0,-2) and new values introduced in order 0..2.at n=42A275565
• Number of 7Xn 0..2 arrays with no element equal to any value at offset (-2,0) (-1,2) or (0,-2) and new values introduced in order 0..2.at n=2A275570
• Numbers m such that b^sigma(m) == b^phi(m) == b^numdiv(m) == b^m (mod m) for every integer b.at n=32A277173
• Triangle read by rows, numerators of coefficients (in rising powers) of rational polynomials P(n, x) such that Integral_{x=0..1} P'(n, x) = Bernoulli(n, 1).at n=51A290694
• Smallest integer such that the sum of its n smallest divisors is a Fibonacci number, or 0 if no such integer exists.at n=34A292467