203450520

Appears in sequences

• Number of closed walks of length n on the complete graph on 6 nodes from a given node.at n=13A109500
• Define a sequence {b(i), i >= 0} by b(i) = 1 for 0 <= i <= n, thereafter b(i+1) = (b(i)+b(i-n)) mod 10; consider the sequence of n-tuples [b(i-n+1), b(i-n+2),...,b(i)]; this repeats with period a(n).at n=10A256985