206158430208
domain: N
Appears in sequences
- a(n) = 3*4^(n-1), n>0; a(0)=1.at n=19A002001
- Smallest number with 2n divisors.at n=36A003680
- Least number with exactly n divisors that are at most its square root.at n=36A038549
- Denominators in the Taylor series for arccosh(x) - log(2*x).at n=17A052469
- Smallest integer with A002191(n) divisors, i.e., the number of divisors equals the sum of the divisors of a different number.at n=32A061072
- Smallest positive integer for which the number of divisors is a product of 2 distinct primes: Min{x; d[x]=pq}.at n=20A061148
- a(n) = shift(a(n-1); a(n-3)), a(0)=2, a(1)=3.at n=6A063728
- Reciprocal of n terminates with an infinite repetition of digit 3. Multiples of 10 are omitted.at n=25A064562
- a(n) is the smallest x such that the quotient d(x)/d(x+1) equals n, where d = A000005.at n=36A080372
- Expansion of (1 - 4*x + 4*x^2 - 4*x^3)/(1 - 4*x).at n=20A092898
- Expansion of (1+3*x)/(1-8*x^2).at n=25A096886
- Smallest number having exactly s divisors, where s is the n-th semiprime (A001358).at n=24A096932
- Number of closed walks on the graph of the (7,4) Hamming code.at n=13A103333
- a(1) = 4, a(2) = 12, for n>1: a(n) = 3*4^(n-1).at n=18A110594
- A Hankel transform of a Catalan product.at n=6A134183
- Hankel transform of A062992 with interpolated zeros.at n=8A138392
- Records in (A063375: Number of divisors of Fibonacci(n)).at n=28A154906
- a(n) = the smallest positive integer with exactly the same number of divisors as in the first n positive integers combined.at n=21A160996
- a(n) = 3 * 4^n.at n=18A164346
- Number of 2 X n binary matrices M with rows in strictly increasing order and rows of M*Mtranspose (mod 2) in strictly decreasing order.at n=19A181278