150994944

Appears in sequences

• a(n) = 9*4^n.at n=12A002063
• Expansion of g.f.: (1+x)/(1-8*x).at n=9A003951
• a(n) = 9*2^n.at n=24A005010
• a(n) = n*8^(n-1).at n=9A053539
• Number of compositions of n into 3*j-1 kinds of j's for all j >= 1.at n=14A055841
• a(n) = n*(n-1)^(n-1).at n=8A055897
• Numbers n such that reciprocal of n terminates with an infinite repetition of digit 1. Multiples of 10 are omitted.at n=5A064560
• Eighth column of triangle A067410.at n=7A067415
• a(n) = the least positive integer k satisfying Omega(k) = Omega(k-1)+...+Omega(k-n) if such k exists; = 0 otherwise. (Omega(n) (A001222) denotes the number of prime factors of n, counting multiplicity.)at n=7A076183
• Expansion of g.f. (1 + 6*x + 5*x^2)/((1-2*x)*(1+2*x)).at n=26A084431
• Binomial transform of A001651.at n=23A084858
• Expansion of (1-4x+6x^2-3x^3)/(1-5x+9x^2-8x^3+4x^4).at n=25A093041
• a(n) = Tau(N), where N = the number obtained as a concatenation of 9801 with itself n times. Tau(n) = number of divisors of n.at n=29A110755
• Third smallest number with exactly n prime factors.at n=25A116453
• Least number of the form semiprime - 1 which is the product of exactly n primes.at n=25A128686
• Smallest number having exactly n square divisors.at n=25A130279
• a(n)=4a(n-2). Also 3*A084221.at n=25A137344
• Triangle: signed version of A055134.at n=46A137370
• Triangle T(n,k) formed by the coordination sequences and the number of leaves for trees.at n=54A158497
• Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^10 = I.at n=9A165787