102590

Appears in sequences

• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (-1, 1, -1), (0, -1, 1), (1, 1, 0)}.at n=10A149186
• Numbers <= 10^6 with valid Luhn mod 10 check digit, sorted first by check digit, then lexicographically.at n=28A249855
• Bitwise XOR of trajectories of rule 30 and rule 124, when both are started from a lone 1 cell: a(n) = A110240(n) XOR A267357(n).at n=8A328103