12582912

Appears in sequences

• a(n) = 3*4^(n-1), n>0; a(0)=1.at n=12A002001
• Smallest number with 2n divisors.at n=22A003680
• Expansion of g.f. (1+x)/(1-2*x).at n=23A003945
• Numbers that are the sum of 3 positive 11th powers.at n=19A004814
• a(n) = 3*2^n.at n=22A007283
• a(n) = Sum_{k=0..m} (k+1) * A026009(n, m-k) where m = floor(n/2)+1.at n=23A027292
• Row sums of the Lucas triangle A029635.at n=23A042950
• Number of 1's in all compositions of n+1.at n=21A045623
• Smallest number x such that cototient(x) = 2^n.at n=23A058764
• 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=21A060344
• Smallest positive integer for which the number of divisors is a product of 2 distinct primes: Min{x; d[x]=pq}.at n=12A061148
• Reciprocal of n terminates with an infinite repetition of digit 3. Multiples of 10 are omitted.at n=15A064562
• a(n) = n! reduced mod 2^n.at n=23A068496
• Numbers m such that the largest prime power in the factorization of m equals phi(m).at n=20A081808
• a(n) = sum of (n-1)-th row terms of triangle A134059.at n=23A082505
• a(n) = (3*8^n + 0^n)/4.at n=8A083233
• a(n+2) = 4*a(n), with a(0)=1, a(1)=3.at n=23A084221
• Least m such that omega(m) + Omega(m) = n, or 0 if no such m exists.at n=25A087009
• Product of digits associated with A091628(n). Essentially the same as A007283.at n=21A091629
• Expansion of (1 - 4*x + 4*x^2 - 4*x^3)/(1 - 4*x).at n=13A092898