133836

Appears in sequences

• a(n) = Sum_{k>=1} floor( 2*(1+sqrt(2))^(n-k) ).at n=12A020963
• Number of steps required for a certain algorithm for producing all permutations of n letters.at n=5A135848
• Number of (n+1) X (2+1) arrays of permutations of 0..n*3+2 with each element having directed index change 0,0 0,1 1,0 -1,0 or 0,-2.at n=5A264211
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,0 0,1 1,0 -1,0 or 0,-2.at n=26A264217
• Number of (6+1)X(n+1) arrays of permutations of 0..n*7+6 with each element having directed index change 0,0 0,1 1,0 -1,0 or 0,-2.at n=1A264223