6377292

Appears in sequences

• a(n) = max{(n - i)*a(i) : i < n}; a(0) = 1.at n=43A000792
• Expansion of (1+x)/(1-3*x).at n=14A003946
• a(1)=1, a(2)=2, a(n) = 4*3^(n-3) for n >= 3.at n=15A025579
• a(n) = Sum_{k=0..m} (k+1) * A026120(n, m-k), where m=0 for n=0,1; m=n for n >= 2.at n=14A027327
• a(n) = n*3^n.at n=12A036290
• Number of compositions of n into 2*j-1 kinds of j's for all j>=1.at n=15A052156
• n*bigomega(n)^n, where bigomega(n) is the number of prime divisors of n, counted with multiplicity.at n=11A061452
• Least common multiple (LCM) of the first n+1 terms of A000792.at n=39A062723
• Least common multiple (LCM) of the first n+1 terms of A000792.at n=40A062723
• Number of n-step walks (each step +-1 starting from 0) which are never more than 2 or less than -2.at n=28A068911
• a(2n+1) = 3^n, a(2n) = 4*3^(n-1) except for a(0) = 1.at n=28A074324
• Goedel encoding of the prime factors of n, in increasing order and repeated according to multiplicity.at n=25A074736
• a(n) = 2^A066657(n) * 3^A066658(n).at n=23A076941
• a(1) = 4; a(n) = if n == 2 mod 3 then a(n-1)/2, if n == 0 mod 3 then a(n-1)*2, if n == 1 mod 3 then a(n-1)*3.at n=41A085689
• a(1) = 4; a(n) = if n == 2 mod 3 then a(n-1)/2, if n == 0 mod 3 then a(n-1)*2, if n == 1 mod 3 then a(n-1)*3.at n=39A085689
• A133566 * A000244.at n=14A133647
• Number of zig-zag paths from top to bottom of a rectangle of width 5 with n rows whose color is that of the top right corner.at n=27A153339
• Denominators of a ternary BBP-type formula for log(3).at n=11A154920
• a(n) = 3*a(n-2) for n > 2; a(1) = 4, a(2) = 3.at n=26A162766
• a(n) = 3*a(n-2) for n > 2; a(1) = 1; a(2) = 4.at n=27A166552