196608
domain: N
Appears in sequences
- a(n) = 3*4^(n-1), n>0; a(0)=1.at n=9A002001
- Numbers that are the sum of 3 nonzero 8th powers.at n=19A003381
- Smallest number with 2n divisors.at n=16A003680
- Expansion of g.f. (1+x)/(1-2*x).at n=17A003945
- Numbers that are the sum of at most 3 nonzero 8th powers.at n=34A004876
- Smallest number with exactly n divisors.at n=33A005179
- Least number which is side of n Pythagorean triples.at n=45A006593
- a(n) = 3*2^n.at n=16A007283
- MU-numbers: next term is uniquely the product of 2 earlier terms.at n=38A007335
- a(n) = Product_{i=0..8} floor((n+i)/9).at n=35A009714
- Triangle of coefficients in expansion of (1+8x)^n.at n=26A013615
- Numbers of form 6^i*8^j, with i, j >= 0.at n=26A025627
- a(n) = Sum_{k=0..m} (k+1) * A026009(n, m-k) where m = floor(n/2)+1.at n=17A027292
- Numbers of the form 2^n or 3*2^n.at n=34A029744
- Numbers of the form 2^k times 1, 3 or 5.at n=50A029747
- Let n = p_1*p_2*...*p_k be the prime factorization of n, with the primes sorted in descending order. Then a(n) = 2^(p_1 - 1)*3^(p_2 - 1)*...*A000040(k)^(p_k - 1).at n=33A037019
- Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*1^j.at n=22A038279
- Row sums of the Lucas triangle A029635.at n=17A042950
- a(n) = n*8^(n-1).at n=6A053539
- If n = p_1^e_1 * p_2^e_2 * p_3^e_3 * ..., p's = distinct primes, e's = positive integers, then a(n) = p_1^(e_1^2) * p_2^(e_2^2) * p_3^(e_3^2) * ... .at n=47A054496