402653184

Appears in sequences

• a(n) = 6*4^n.at n=13A002023
• Expansion of g.f. (1+x)/(1-2*x).at n=28A003945
• a(n) = 3*2^n.at n=27A007283
• a(n) = n*2^n.at n=24A036289
• Row sums of the Lucas triangle A029635.at n=28A042950
• Smallest number x such that cototient(x) = 2^n.at n=28A058764
• 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=26A060344
• a(n) = n*omega(n)^n where omega(n) is the number of distinct prime divisors of n.at n=23A061340
• Reciprocal of n terminates with an infinite repetition of digit 6. Multiples of 10 are omitted.at n=19A064565
• a(n) = 2*2^n - (-2)^n.at n=27A081631
• Numbers m such that the largest prime power in the factorization of m equals phi(m).at n=25A081808
• a(n) = sum of (n-1)-th row terms of triangle A134059.at n=28A082505
• Expansion of g.f. (1 + 6*x + 5*x^2)/((1-2*x)*(1+2*x)).at n=27A084431
• Number of ground-state 3-ball juggling sequences of period n.at n=16A084509
• Least m such that omega(m) + Omega(m) = n, or 0 if no such m exists.at n=30A087009
• Number of subsets of {1,.., n} containing exactly one prime.at n=36A089821
• Product of digits associated with A091628(n). Essentially the same as A007283.at n=26A091629
• Expansion of (1+3*x)/(1-8*x^2).at n=19A096886
• Expansion of (1 - 4*x + 6*x^2)/(1 - 2*x)^2.at n=25A097064
• 10^a(n) + 1 = A088773(n).at n=30A098011