25165824

Appears in sequences

• a(n) = 6*4^n.at n=11A002023
• Expansion of g.f. (1+x)/(1-2*x).at n=24A003945
• a(n) = 3*2^n.at n=23A007283
• a(n) = lcm(n, 2^(n-1)).at n=23A014964
• Row sums of the Lucas triangle A029635.at n=24A042950
• Smallest number x such that cototient(x) = 2^n.at n=24A058764
• A hierarchical sequence (W'3{2,2}cc - see A059126).at n=31A059157
• 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=22A060344
• Reciprocal of n terminates with an infinite repetition of digit 6. Multiples of 10 are omitted.at n=16A064565
• a(n) = n! reduced mod 2^n.at n=25A068496
• a(1)=2, a(n+1) = 2*a(n) - phi(a(n)) where phi is the Euler totient function A000010.at n=36A072944
• Refactorable numbers x, such that quotient x/A000005(x) equals a power of 2.at n=24A078541
• a(n) = n*2^(n-4).at n=20A079859
• a(n) = 2*2^n - (-2)^n.at n=23A081631
• Numbers m such that the largest prime power in the factorization of m equals phi(m).at n=21A081808
• a(n) = sum of (n-1)-th row terms of triangle A134059.at n=24A082505
• Expansion of g.f. (1 + 6*x + 5*x^2)/((1-2*x)*(1+2*x)).at n=23A084431
• Number of ground-state 3-ball juggling sequences of period n.at n=14A084509
• Least m such that omega(m) + Omega(m) = n, or 0 if no such m exists.at n=26A087009
• a(0) = a(1) = 1; for n > 1, a(n) = (n+2)*2^(n-2).at n=22A087447