4067256

Appears in sequences

• Number of (directed) Hamiltonian circuits on the n-antiprism graph.at n=18A124353
• Number of ways to toss a coin n times and not get a run of five.at n=23A135492
• Number of sequences of length n with elements {-2,-1,+1,+2}, such that the sum of elements of the whole sequence but of no proper subsequence equals 0 modulo n. For n>=4, the number of Hamiltonian (directed) circuits on the circulant graph C_n(1,2).at n=37A137725