75497472

Appears in sequences

• a(n) = 9*2^n.at n=23A005010
• Reciprocal of n terminates with an infinite repetition of digit 2. Multiples of 10 are omitted.at n=5A064561
• Refactorable numbers x, such that quotient x/A000005(x) equals a power of 2.at n=26A078541
• a(n) = (n+1)^n*binomial(n+2,2).at n=7A081132
• 8th binomial transform of (0,0,1,0,0,0, ...).at n=9A081138
• Number of divisors of n-th cyclic number.at n=18A087024
• Smallest number beginning with 7 and having exactly n prime divisors counted with multiplicity.at n=24A106427
• a(n) = tau(N), where N = the number obtained as a concatenation of 8712 with itself n times and tau(n) = number of divisors of n.at n=34A110754
• Third smallest number with exactly n prime factors.at n=24A116453
• a(0)=7, a(n) = 2*a(n-1) + 2^(n-1) for n > 0.at n=22A159695
• a(n) = n^8*(n + 1)/2.at n=8A168675
• The total number of components of size 2 over all simple labeled graphs on n nodes.at n=7A182166
• Odd powers of 2 and 9 times odd powers of 2, sorted.at n=24A190787
• a(n) = 3n*4^(2n-1).at n=5A193132
• Triangular array read by rows: T(n,k) is the number of connected components with size k summed over all simple labeled graphs on n nodes; n>=1, 1<=k<=n.at n=37A223894
• a(n) = composite(n)*2^(n - 3).at n=23A240135
• Coefficients in the expansion of 1/([r] + [2r]x + [3r]x^2 + ...); [ ] = floor, r = 3/2.at n=26A279634
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 329", based on the 5-celled von Neumann neighborhood.at n=26A287717
• Triangle read by rows: T(0,0) = 1; T(n,k) = 8 * T(n-1,k) + T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.at n=38A317028
• a(0) = 1; for n > 0, a(n) = A000005(n) * a(n-A000005(n)), where A000005(n) gives the number of divisors of n.at n=53A320009