3221225472

Appears in sequences

• a(n) = 3*4^(n-1), n>0; a(0)=1.at n=16A002001
• Smallest number with 2n divisors.at n=30A003680
• Expansion of g.f. (1+x)/(1-2*x).at n=31A003945
• a(n) = 3*2^n.at n=30A007283
• Binomial transform of Thue-Morse sequence A001285.at n=31A029879
• Least number with exactly n divisors that are at most its square root.at n=30A038549
• Row sums of the Lucas triangle A029635.at n=31A042950
• a(n) is the smallest number such that a(n)+1 is a prime and the largest power of 2 which divides it is 2^n.at n=30A057777
• Smallest number x such that cototient(x) = 2^n.at n=31A058764
• a(n) = (n+1)*2^(n+4).at n=24A059165
• For n >= 2, let N_n denote the set of all unipotent upper-triangular real n X n matrices A such that for every k=1,2,...,n-1 the minor of A with rows 1,2,...,k and columns n-k+1,...,n is nonzero. a(n) is the number of connected components of N_n.at n=29A060344
• Smallest integer with A002191(n) divisors, i.e., the number of divisors equals the sum of the divisors of a different number.at n=28A061072
• Smallest positive integer for which the number of divisors is a product of 2 distinct primes: Min{x; d[x]=pq}.at n=17A061148
• Reciprocal of n terminates with an infinite repetition of digit 3. Multiples of 10 are omitted.at n=21A064562
• Composites of form prime-1 containing a record number of prime factors.at n=24A066632
• a(n) is the smallest x such that the quotient d(x)/d(x+1) equals n, where d = A000005.at n=30A080372
• Numbers m such that the largest prime power in the factorization of m equals phi(m).at n=28A081808
• a(n) = sum of (n-1)-th row terms of triangle A134059.at n=31A082505
• a(n+2) = 4*a(n), with a(0)=1, a(1)=3.at n=31A084221
• Expansion of (1-3x+4x^2-3x^3+x^4)/(1-2x)^2.at n=29A084861