110810

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=41A068924
• Transform of 1 by the T_{1,1} transformation (see link).at n=13A159328
• Number of binary strings of length n with no substrings equal to 0001 or 0100.at n=20A164394
• The Padovan sequence A000931 doubled.at n=45A291289
• Number of ways to choose a constant rooted partition of each part in a rooted partition of n.at n=27A301762