29415

Appears in sequences

• a(n) = (2*n^3 + 5*n^2 + 11*n)/2.at n=29A162263
• a(0)=1, a(1)=5, a(n) = 20*a(n-2) - a(n-1).at n=8A165470
• Records in A087669.at n=37A192230
• The number of permutations of length n sortable by 2 reversals.at n=21A228396
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every element equal to some horizontal, diagonal or antidiagonal neighbor, with top left element zero.at n=28A232076
• Number of (1+1) X (n+1) 0..1 arrays with every element equal to some horizontal, diagonal or antidiagonal neighbor, with top left element zero.at n=7A232077
• Triangle read by rows: T(n,g) = number of general immersions of a circle with n crossings in a surface of arbitrary genus g (the circle is not oriented, the surface is not oriented).at n=22A260914
• T(n,k)=Number of nXk 0..1 arrays with every element both equal and not equal to some elements at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) (1,-1) (1,0) or (1,1), with upper left element zero.at n=46A278208
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=46A302381
• T(n,k) = Number of n X k 0..1 arrays with every element equal to 1, 2, 3, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=46A302953
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=46A303102