55896

Appears in sequences

• Numbers occurring twice in A068627.at n=34A068628
• The number of ways to color n balls in a row with 3 colors with no color runs having lengths greater than 4. This sequence is a special case of the general problem for coloring n balls in a row with p colors where each color has a given maximum run-length. In this example, the bounds are uniformly 4. It can be phrased in terms of tossing a p-faced die n times, requiring each face to have no runs longer than b.at n=9A181140
• Expansion of (1 + 2*x + 2*x^2) / (1 - x)^6.at n=15A244882
• a(n) = n*(n + 1)*(n + 2)*(9*n - 7)/12.at n=16A264852
• Number of nX5 arrays of permutations of 5 copies of 0..n-1 with every element equal to at least one horizontal neighbor and the top left element equal to 0.at n=4A267722
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to at least one horizontal neighbor and the top left element equal to 0.at n=40A267724
• a(n) = 4*((2*n-1)*a(n-1) + (-1)^n*(n-2)!), with a(1) = 8, n > 1.at n=3A302944
• a(n) = Sum_{k=1..n} k^2*sigma(k), where sigma is A000203.at n=18A319086