261535698060domain: NAppears in sequencesa(n) = 10*a(n-1) + 11*a(n-2).at n=12A015592a(n) = Sum_{k=0..n} (-1)^(n-k)*n^k.at n=11A081209Number of sequences of length n with terms from {0,1,...,n-1} such that the sum of terms is 0 modulo n and the i-th term is not i.at n=11A173499Ben Ames Williams's Monkey and Coconuts Problem.at n=11A276135