83648

Appears in sequences

• Number of ways to tile a 5 X 2n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.at n=40A068924
• Number of (n+1) X (1+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or antidiagonally, with no adjacent elements equal.at n=20A232582
• Number of length 4+4 0..n arrays with every five consecutive terms having four times some element equal to the sum of the remaining four.at n=10A249660
• The Padovan sequence A000931 doubled.at n=44A291289
• Triangle read by rows: T(n,k) is the number of acyclic graphs on n unlabeled nodes whose longest directed path has k arcs.at n=32A350448
• Number of longest winning paths in n X n Hex.at n=17A375299