34044

Appears in sequences

• Number of permutations of 4 copies of 1..n avoiding adjacent step pattern up, up, down, up, up.at n=2A177655
• Augmentation of the triangle A193596. See Comments.at n=50A193597
• a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1, 2] as of [1, 3, 1].at n=10A211291
• Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 3 - x^2.at n=40A368152
• Expansion of g.f. A(x) satisfying A(x) = A( x^2*(1+x)^2 ) / (x*(1+x)).at n=17A369545