45056

Appears in sequences

• a(n) = 11*4^n.at n=6A002089
• a(n) = 11*2^n.at n=12A005015
• Numbers whose prime factors are 2 and 11.at n=25A033848
• Numbers k such that Sum_{j} p_j = Sum_{j} e_j where Product_{j} p_j^(e_j) is the prime factorization of k.at n=35A054411
• a(n) = n*2^n - 2^n = 2^n*(n-1).at n=11A058922
• 13-almost primes (generalization of semiprimes).at n=9A069274
• Numbers k such that the number of steps to reach 1 in '3x+1' problem equals tau(k), the number of divisors of k.at n=48A070980
• Denominators in the Maclaurin series for arctan(1+x).at n=21A075554
• a(0) = 1, a(n) = (n + 4)*4^(n-1) for n >= 1.at n=7A079028
• a(n) is the number of occurrences of 11s in the palindromic compositions of m=2*n-1 = the number of occurrences of 12s in the palindromic compositions of m=2*n.at n=10A079863
• Duplicate of A079028.at n=7A081104
• Square array, read by antidiagonals, where the n-th row is the n-th binomial transform of the natural numbers, with T(0,k) = (k+1) for k>=0.at n=58A089944
• Consider the triangle in which the j-th row begins with prime(j) and is the arithmetic progression with least common difference such that the remaining j-1 terms are composite and not divisible by prime(j). Sequence gives last term in each row.at n=35A095182
• Numbers of the form (8^i)*(11^j), with i, j >= 0.at n=16A107788
• Numbers of the form (4^i)*(11^j), with i, j >= 0.at n=23A107988
• a(0)=44; if n odd, a(n) = a(n-1)/2, otherwise a(n) = 4*a(n-1).at n=23A108213
• a(0)=44; if n odd, a(n) = a(n-1)/2, otherwise a(n) = 4*a(n-1).at n=20A108213
• a(0)=22; if n odd, a(n) = a(n-1)/2, otherwise a(n) = 4*a(n-1).at n=25A108732
• a(0)=22; if n odd, a(n) = a(n-1)/2, otherwise a(n) = 4*a(n-1).at n=22A108732
• First differences of A109975.at n=14A111297