22494

Appears in sequences

• a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049723.at n=27A049724
• Triangle T(n,k) (n >= 2, 1 <= k <= n-1) read by rows, where T(n,k) is the number of words of length n in the free group on three generators that require exactly k multiplications for their formation.at n=43A076262
• a(n) is the smallest integer k such that the n-th (backward) difference of the partition sequence A000041 is positive from k onwards.at n=35A155861
• a(n) = 36*n^2 - 6.at n=24A158462
• T(n,k) = Number of n X k 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=47A280398
• Number of 3Xn 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=7A280401
• Solution (a(n)) of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) + b(n); see Comments.at n=37A305330
• a(n) is the number of edges formed by n-secting the angles of a hexagon.at n=36A335735