33285996544
domain: N
Appears in sequences
- a(n) = n*2^(n-1).at n=31A001787
- a(n) = 2^(2*n)*(2*n+1).at n=15A058962
- 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=30A090634
- Expansion of g.f. (1-4*x+5*x^2)/(1-2*x)^2.at n=32A097067
- Binomial transform of A004526.at n=32A139756
- Least number divisible by n whose number of divisors is also divisible by n.at n=30A272348
- Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 267", based on the 5-celled von Neumann neighborhood.at n=34A287463
- Numbers of the form p*2^(p-1) where p is prime.at n=10A299795
- (1/4) times the sum of the elements of all subsets of [n] whose sum is divisible by four.at n=31A309296
- Expansion of Sum_{n>=1} ( (2 + x^n)^n - 2^n ).at n=30A318637
- a(n) = Sum_{k=0..2n}(k!*(2n - k)!)/(floor(k/2)!*floor((2n - k)/2)!)^2.at n=15A327999
- a(n) = Sum_{k=0..n}(k!*(n - k)!)/(floor(k/2)!*floor((n - k)/2)!)^2.at n=30A328000
- a(n) = Sum_{d|n} 2^(d-1) * binomial(d, n/d).at n=30A338695
- Lesser member of Carmichael's variant of amicable pair: numbers k < m such that s(k) = m and s(m) = k, where s(k) = A371418(k).at n=23A371419