166515

Appears in sequences

• a(n) = smallest k such that A(k) == 0 (mod 2^n), where A(0) = 1 and A(k) = k*A(k-1) + 1 = A000522(k).at n=17A127014
• a(n) = smallest k such that A(k) == 0 (mod 2^n), where A(0) = 1 and A(k) = k*A(k-1) + 1 = A000522(k).at n=18A127014
• a(n) = smallest k such that A(k) == 0 (mod 2^n), where A(0) = 1 and A(k) = k*A(k-1) + 1 = A000522(k).at n=19A127014
• Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 1000-1100-0111-0010 pattern in any orientation.at n=12A147148
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (1, 0, 1), (1, 1, -1)}.at n=11A148824