40336

Appears in sequences

• a(n) = floor(tau*a(n-1)) + a(n-2) with a(0)=0 and a(1)=2.at n=15A005829
• Let N(k) and D(k) be the sequences defined in A054765 and A012244; write N(k)* D(k+j ) - N(k+j)*D(k) = (-1)^(k+1)*(k!)^2*P(k) where P(k) is a polynomial in k of degree j-1; sequence gives coefficients of expansion of P(k) in powers of k for j=1,2,3,...at n=19A054798
• Triangle sequence:t(n,m)=(2 n - Binomial[n, m] + m! + (-m + n)!).at n=36A155169
• Triangle sequence:t(n,m)=(2 n - Binomial[n, m] + m! + (-m + n)!).at n=44A155169
• Number of nX1 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and no element equal to any horizontal or vertical neighbor.at n=18A199126
• E.g.f. satisfies: A(x) = sinh(x + Integral A(x) dx).at n=8A235038
• Words of length n over the alphabet {0,...,n-1} that avoid the pattern 1231.at n=6A239377
• Number of n X 5 0..1 arrays with every element unequal to 0, 1, 2 or 7 king-move adjacent elements, with upper left element zero.at n=12A304227
• a(n) = 8*7*6*5*4*3*2*1 + 16*15*14*12*11*10*9 + ... + (up to the n-th term).at n=8A319872