2415919104

Appears in sequences

• a(n) = 9*4^n.at n=14A002063
• a(n) = 9*2^n.at n=28A005010
• Number of compositions of n into 3*j-1 kinds of j's for all j >= 1.at n=16A055841
• A hierarchical sequence (S(W'2{3}*c) - see A059126).at n=23A059162
• Smallest positive integer for which the number of divisors is a product of 2 distinct primes: Min{x; d[x]=pq}.at n=25A061148
• Reciprocal of n terminates with an infinite repetition of digit 4. Multiples of 10 are omitted.at n=6A064563
• Eighth column of triangle A067410.at n=8A067415
• a(n) is the number of occurrences of 7's in the palindromic compositions of 2*n-1, or also, the number of occurrences of 8's in the palindromic compositions of 2*n.at n=26A079861
• 8th binomial transform of (1,1,0,0,0,0,...).at n=10A081108
• Expansion of g.f. (1 + 6*x + 5*x^2)/((1-2*x)*(1+2*x)).at n=30A084431
• Smallest number having exactly s divisors, where s is the n-th semiprime (A001358).at n=29A096932
• Smallest number beginning with 2 and having exactly n prime divisors counted with multiplicity.at n=29A106422
• Third smallest number with exactly n prime factors.at n=29A116453
• Total number of "Emperors" in all tournaments on n labeled nodes.at n=9A123903
• a(n) = n^2*4^n.at n=12A128782
• a(n) = 5*a(n-1) - 9*a(n-2) + 8*a(n-3) - 4*a(n-4), with a(0)=0, a(1)=0, a(2)=0, a(3)=1.at n=29A137221
• a(n)=4a(n-2). Also 3*A084221.at n=29A137344
• a(n) = the smallest positive integer with exactly the same number of divisors as in the first n positive integers combined.at n=24A160996
• a(n) = n^2 if n is odd, n^2*2^(n-2) if n is even.at n=24A168251
• One quarter the number of nX2 1..4 arrays with no two neighbors of any element equal to each other.at n=14A183354