33010

Appears in sequences

• Number of graphs on n nodes with 3 cliques.at n=23A005289
• a(n) = Sum_{k=0..floor(n/2)} T(n-k, k), T given by A026692.at n=20A026702
• a(n) = 8^n + 3^n - 1.at n=5A155606
• Solution of the complementary equation a(n) = 2*a(n-1) + a(n-2) + b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (a(n)) and (b(n)) are increasing complementary sequences.at n=11A295143
• a(n) = (1/4) * Sum_{k=0..floor(n/3)} (n-2*k+2) * binomial(2*n-4*k+2,2*k+1).at n=12A391831