51539607552
domain: N
Appears in sequences
- a(n) = 3*4^(n-1), n>0; a(0)=1.at n=18A002001
- Denominator of Bernoulli(2n,1/2).at n=17A033469
- Reciprocal of n terminates with an infinite repetition of digit 3. Multiples of 10 are omitted.at n=24A064562
- Composites of form prime+1 containing a record number of prime factors.at n=24A066617
- a(n) = (3*8^n + 0^n)/4.at n=12A083233
- Expansion of (1 - 4*x + 4*x^2 - 4*x^3)/(1 - 4*x).at n=19A092898
- a(1) = 4, a(2) = 12, for n>1: a(n) = 3*4^(n-1).at n=17A110594
- Records in (A063375: Number of divisors of Fibonacci(n)).at n=26A154906
- Denominator of Bernoulli(n, 1/2).at n=34A157780
- a(n) = 3 * 4^n.at n=17A164346
- a(n) = 8*a(n-2) for n > 2; a(1) = 1, a(2) = 6.at n=23A164640
- Consider the list s(1), s(2), ... of numbers that are products of exactly n primes; a(n) is the smallest s(j) whose decimal expansion ends in j.at n=35A186000
- Main transitions in systems of n particles with spin 3/2.at n=15A212698
- Write the coefficient of x^n/n! in the expansion of (x/(exp(x)-1))^(1/2) as f(n)/g(n); sequence gives g(n).at n=17A242225
- Smallest m such that |A259029(m)| = n.at n=17A259031