50331648

Appears in sequences

• a(n) = (n+2)*2^(n-1).at n=22A001792
• a(n) = 3*4^(n-1), n>0; a(0)=1.at n=13A002001
• a(n) = n*4^(n-1).at n=12A002697
• Expansion of g.f. (1+x)/(1-2*x).at n=25A003945
• a(n) = 3*2^n.at n=24A007283
• a(n) = Sum_{k=0..m} (k+1) * A026009(n, m-k) where m = floor(n/2)+1.at n=25A027292
• Row sums of the Lucas triangle A029635.at n=25A042950
• a(n) = Sum_{k=0..floor(n/2)} k*binomial(n,2*k) = floor(n*2^(n-3)).at n=24A049610
• Smallest number x such that cototient(x) = 2^n.at n=25A058764
• 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=23A060344
• Reciprocal of n terminates with an infinite repetition of digit 3. Multiples of 10 are omitted.at n=17A064562
• Numbers m such that the largest prime power in the factorization of m equals phi(m).at n=22A081808
• a(n) = sum of (n-1)-th row terms of triangle A134059.at n=25A082505
• a(n+2) = 4*a(n), with a(0)=1, a(1)=3.at n=25A084221
• Least m such that omega(m) + Omega(m) = n, or 0 if no such m exists.at n=27A087009
• Product of digits associated with A091628(n). Essentially the same as A007283.at n=23A091629
• Expansion of (1 - 4*x + 4*x^2 - 4*x^3)/(1 - 4*x).at n=14A092898
• a(n) = smallest positive number that occurs exactly n times as a difference between two positive squares.at n=22A094191
• Expansion of (1+3*x)/(1-8*x^2).at n=17A096886
• 10^a(n) + 1 = A088773(n).at n=27A098011