38912

Appears in sequences

• 12-almost primes (generalization of semiprimes).at n=20A069273
• Sum of the divisors of 2^n - 1.at n=14A075708
• a(n) = 2^n*Lucas(n), where Lucas = A000032.at n=9A087131
• Smallest number ending with the digits of n that has exactly n prime factors (counted with multiplicity).at n=11A109687
• a(n) = 19*2^n.at n=11A110288
• Number of intersections of at least four edges in a cube of n X n X n smaller cubes.at n=32A126562
• Third differences of A129952.at n=13A129955
• a(n) = 8*a(n-1) - 8*a(n-2) for n > 1; a(0) = 1, a(1) = 16.at n=5A164542
• Number of subsets of {1, 2, ..., n} containing n and having pairwise coprime elements; also row sums of A186972.at n=44A186973
• Numbers k such that (number of prime factors of k counted with multiplicity) less (number of distinct prime factors of k) = 10.at n=13A195069
• (n-1)-st elementary symmetric function of the first n terms of the periodic sequence (1,1,1,2,1,1,1,2,...).at n=42A203234
• Bit reversed 16-bit numbers.at n=25A217589
• Number of groups of order prime(n)^6.at n=27A232106
• Sum of the divisors of n^3 - 1.at n=30A234860
• Number of digits in the decimal expansion of the number of partitions of 5^n.at n=13A248731
• Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.at n=51A249252
• a(n) = 3*p^2+39*p+344+24*gcd(p-1,3)+11*gcd(p-1,4)+2*gcd(p-1,5), where p = prime(n).at n=27A269749
• Expansion of 2*x*(1+4*x) / (1-12*x+16*x^2).at n=4A270445
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 141", based on the 5-celled von Neumann neighborhood.at n=16A279148
• T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than three of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element.at n=46A283950