131345

Appears in sequences

• Smallest k>2^n such that 2^k == 2^n (mod k).at n=16A015938
• a(n) is number of cycles in Moebius ladder M_n.at n=17A020873
• Number of defective 3-colorings of an n X 3 0..2 array connected horizontally and vertically with exactly two mistakes, and colors introduced in row-major 0..2 order.at n=5A229601
• Number of defective 3-colorings of an n X 6 0..2 array connected horizontally and vertically with exactly two mistakes, and colors introduced in row-major 0..2 order.at n=2A229604
• T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected horizontally and vertically with exactly two mistakes, and colors introduced in row-major 0..2 order.at n=30A229606
• T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected horizontally and vertically with exactly two mistakes, and colors introduced in row-major 0..2 order.at n=33A229606