3145728

Appears in sequences

• a(n) = 3*4^(n-1), n>0; a(0)=1.at n=11A002001
• Expansion of g.f. (1+x)/(1-2*x).at n=21A003945
• Numbers that are the sum of 3 nonzero 10th powers.at n=19A004803
• a(n) = 3*2^n.at n=20A007283
• a(n) = Sum_{k=0..m} (k+1) * A026009(n, m-k) where m = floor(n/2)+1.at n=21A027292
• Numbers of the form 2^n or 3*2^n.at n=42A029744
• Row sums of the Lucas triangle A029635.at n=21A042950
• First differences of A045623.at n=20A045891
• Smallest number x such that cototient(x) = 2^n.at n=21A058764
• For n >= 2, let N_n denote the set of all unipotent upper-triangular real n X n matrices A such that for every k=1,2,...,n-1 the minor of A with rows 1,2,...,k and columns n-k+1,...,n is nonzero. a(n) is the number of connected components of N_n.at n=19A060344
• Reciprocal of n terminates with an infinite repetition of digit 3. Multiples of 10 are omitted.at n=14A064562
• Smallest integer that can be expressed as the sum of consecutive odd numbers in exactly n ways.at n=18A068314
• Coefficient of the highest power of q in the expansion of nu(0)=1, nu(1)=b and for n>=2, nu(n)=b*nu(n-1)+lambda*(n-1)_q*nu(n-2) with (b,lambda)=(2,2), where (n)_q=(1+q+...+q^(n-1)) and q is a root of unity.at n=40A072946
• a(n) = tau(Fibonacci(24*2^n))/(24*2^n) where tau(x) is the number of divisors of x (A000005(x)).at n=6A074699
• Numbers k such that phi(k) is a perfect tenth power.at n=26A078170
• Inverse binary transform of A027656.at n=20A081037
• Numbers m such that the largest prime power in the factorization of m equals phi(m).at n=18A081808
• a(n) = sum of (n-1)-th row terms of triangle A134059.at n=21A082505
• a(n+2) = 4*a(n), with a(0)=1, a(1)=3.at n=21A084221
• Least m such that omega(m) + Omega(m) = n, or 0 if no such m exists.at n=23A087009