53248

Appears in sequences

• a(n) = n*2^(n-1).at n=13A001787
• Bisection of A002470.at n=32A002287
• a(n) = 13*2^n.at n=12A005029
• a(n) = lcm(n, 2^(n-1)).at n=12A014964
• a(n+1)=2a(n)-4a(n-1)+4a(n-2).at n=19A035302
• Triangle read by rows: T(n,k) (n >= 2, 0 <= k <= n) = number of over-all crude totals of unbranched k-5-catapolyheptagons.at n=36A038195
• a(n) = Product_{k=1..n-1} gcd(k,n).at n=25A051190
• a(n) = 2^(2*n)*(2*n+1).at n=6A058962
• Permutation of N induced by rotating the node 3 left in the infinite planar binary tree shown at A065658.at n=56A065665
• 13-almost primes (generalization of semiprimes).at n=12A069274
• Numbers n such that the squarefree kernel of n is equal to the number of divisors of n.at n=22A070226
• Let x(1)=1, x(n+1) = (4/3)*x(n) - floor((4/3)*x(n)); then a(n)=x(n)*3^n.at n=10A073533
• Smallest multiple k*n of n having n divisors.at n=25A073904
• Refactorable numbers x, such that quotient x/A000005(x) equals a power of 2.at n=15A078541
• 8th binomial transform of (1,1,0,0,0,0,...).at n=5A081108
• Triangle read by rows: T(n,m) = 4^m * (2*n+1)! / ( (2*n - 2*m + 1)! * (2*m)! ), row n has n+1 terms.at n=27A085840
• Start with the sequence [1, 1/2, 1/3, ..., 1/n]; form new sequence of n-1 terms by taking averages of successive terms; repeat until reach a single number F(n); a(n) = denominator of F(n).at n=12A090634
• Expansion of g.f. (1-4*x+5*x^2)/(1-2*x)^2.at n=14A097067
• a(n) = 4^(n-1)*Fibonacci(n).at n=7A099133
• a(n) = -2*a(n-1) + 4*a(n-3), with a(0) = 1, a(1) = -2, a(2) = 4.at n=17A099211