2814669

Appears in sequences

• a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 2. Also a(n) = 3^n*C(n-1), where C = A000108 (Catalan numbers).at n=7A025226
• Expansion of (sqrt(1-12*x^2)+12*x^2+2*x-1)/(2*x*sqrt(1-12*x^2)).at n=15A103978
• Number of 4-ary Lyndon words of length n with exactly five 1s.at n=8A124813
• Numbers k such that k, A001414(k) and A083345(k) are all multiples of 3, where A001414 is fully additive with a(p) = p, and A083345 is the numerator of the fully additive function with a(p) = 1/p.at n=25A373476
• a(n) = Sum_{k=0..n} k^2 * 2^(n-k) * binomial(n,k).at n=11A383136