100663296

Appears in sequences

• a(n) = 6*4^n.at n=12A002023
• a(n) = n*2^(2*n-1).at n=12A002699
• Expansion of g.f. (1+x)/(1-2*x).at n=26A003945
• a(n) = 3*2^n.at n=25A007283
• Row sums of the Lucas triangle A029635.at n=26A042950
• Denominators in the Taylor series for arccosh(x) - log(2*x).at n=11A052469
• a(n) = 2^(n-2)*(n^2 - n + 4).at n=20A053730
• a(0)=0, a(1)=1, a(n) = n*2^(n-2) for n >= 2.at n=24A057711
• Smallest number x such that cototient(x) = 2^n.at n=26A058764
• 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=24A060344
• Reciprocal of n terminates with an infinite repetition of digit 6. Multiples of 10 are omitted.at n=17A064565
• Smallest n-digit number with only prime divisors 2 or 3 (i.e., of the form 2^a * 3^b).at n=8A069653
• a(n) = 2*2^n - (-2)^n.at n=25A081631
• Numbers m such that the largest prime power in the factorization of m equals phi(m).at n=23A081808
• a(n) = sum of (n-1)-th row terms of triangle A134059.at n=26A082505
• a(n) = (7*8^n + (-8)^n)/8.at n=9A083225
• a(n) = (3*8^n + 0^n)/4.at n=9A083233
• Expansion of g.f. (1 + 6*x + 5*x^2)/((1-2*x)*(1+2*x)).at n=25A084431
• Number of ground-state 3-ball juggling sequences of period n.at n=15A084509
• Least m such that omega(m) + Omega(m) = n, or 0 if no such m exists.at n=28A087009