69988

Appears in sequences

• a(n) = smallest multiple of 4 with sum of digits = n.at n=39A077489
• Number of nX2 0..3 arrays with new values 0..3 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).at n=5A208347
• Number of nX6 0..3 arrays with new values 0..3 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).at n=1A208351
• T(n,k) is the number of n X k 0..3 arrays with new values 0..3 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).at n=22A208353
• T(n,k) is the number of n X k 0..3 arrays with new values 0..3 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).at n=26A208353
• Number of (n+3) X 8 0..2 matrices with each 4 X 4 subblock idempotent.at n=14A224725
• Place n equally spaced points on each side of a square, and join each of these points by a chord to the 3*n new points on the other three sides: sequence gives number of regions in the resulting planar graph.at n=10A367278