240000

Appears in sequences

• Number of sublattices of index n in generic 4-dimensional lattice.at n=41A038991
• Generalized Stirling number triangle of first kind.at n=10A048176
• 10-factorial numbers.at n=4A051262
• a(n) = phi(2^n - 1)/2.at n=18A056742
• a(1) = 2, a(n+1) > a(n) is the smallest multiple of a(n) using only even digits.at n=11A078222
• a(1) = 2; for n>1, a(n)=SENSigma(a(n-1)), where SENSigma(m) = (-1)^((Sum_i r_i)+Omega(m))*Sum_{d|m} (-1)^((Sum_j Max(r_j))+Omega(d))*d = Product_i (Sum_{1<=s_i<=r_i} p_i^s_i)+(-1)^(r_i+1) if m=Product_i p_i^r_i, d=Product_j p_j^r_j, p_j^max(r_j) is the largest power of p_j dividing m.at n=18A125141
• a(n) = Product_{k>=0} (1 + floor(n/2^k)).at n=39A132269
• Totally multiplicative sequence with a(p) = 10p for prime p.at n=23A166631
• Totally multiplicative sequence with a(p) = 10*(p+3) for prime p.at n=29A167329
• Totally multiplicative sequence with a(p) = (p+2)*(p+3) = p^2+5p+6 for prime p.at n=23A167360
• Integers that can be generated with a C/C++ expression that is two or more characters shorter than their decimal representation.at n=23A168651
• Upper bound in enumerating what majority decisions are possible with possible abstaining.at n=5A174335
• Number of zero trace primitive elements in Galois field GF(2^n).at n=19A192211
• Łukasiewicz words (without the last zero) for rooted plane trees where non-leaf branching can occur only at the leftmost branch of any level, but nowhere else.at n=36A209644
• Number of 2 X 2 matrices having all elements in {0,1,...,n} and determinant = 1 (mod 3).at n=29A211034
• Number of 2 X 2 matrices having all terms in {1,...,n} and determinant = 1 (mod 3).at n=29A211071
• Composite numbers m such that Sum_{i=1..k} (p_i/(p_i+1)) - Product_{i=1..k} (p_i/(p_i-1)) is an integer, where p_i are the k prime factors of m (with multiplicity).at n=30A230111
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 11 (11 maximizes T(1,1)).at n=36A233883
• Numbers such that (sum + product) of all their prime factors equals (sum + product) of all exponents in their prime factorization.at n=28A272818
• Number of 3 X n 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=11A275566