4980736

Appears in sequences

• a(n) = n*2^(n-1).at n=19A001787
• a(n) = lcm(n, 2^(n-1)).at n=18A014964
• a(n) = Product_{k=1..n-1} gcd(k,n).at n=37A051190
• a(n) = 2^(2*n)*(2*n+1).at n=9A058962
• 19-almost primes (generalization of semiprimes).at n=20A069280
• Refactorable numbers x, such that quotient x/A000005(x) equals a power of 2.at n=21A078541
• Start with the sequence [1, 1/2, 1/3, ..., 1/n]; form new sequence of n-1 terms by taking averages of successive terms; repeat until reach a single number F(n); a(n) = denominator of F(n).at n=18A090634
• Expansion of g.f. (1-4*x+5*x^2)/(1-2*x)^2.at n=20A097067
• a(n) = 19*2^n.at n=18A110288
• Binomial transform of A004526.at n=20A139756
• a(1) = 1; for n > 1, a(n) = 2*a(n-1) if n is even, a(n) = ((n+1)/(n-1))*a(n-1) if n is odd.at n=36A171647
• Composite numbers n such that p^2 * (p - 1) divides 2(n - p) for every prime p dividing n.at n=34A175670
• Numbers with 38 divisors.at n=6A175747
• a(n) = sin((2*n+5)*Pi/6)*(n+1)*2^(n+1).at n=18A176900
• Sequence related to discriminant of cyclotomic polynomials A004124.at n=37A193679
• Number of (possibly overlapping) occurrences of the subword given by the binary expansion of n in all binary words of length n.at n=23A228612
• Number of parts in all palindromic compositions of n.at n=37A239632
• E.g.f.: Sum_{n>=1} x^(n^2) * exp(2*x^n) / n!.at n=18A259223
• Least number divisible by n whose number of divisors is also divisible by n.at n=18A272348
• Least number divisible by n whose number of divisors is also divisible by n.at n=37A272348