102640
domain: N
Appears in sequences
- Number of permutations p of {1,...,n} satisfying p(1)=1 and, if n>1, |p(i)-p((i mod n)+1)| is in {2,3} for i from 1 to n.at n=50A174469
- Numbers <= 10^6 with valid Luhn mod 10 check digit, sorted first by check digit, then lexicographically.at n=29A249855
- Expansion of Sum_{k>0} x^(2*k)/(1-x^k)^5.at n=38A363605