87009

Appears in sequences

• a(n) = (10n+1)*(10n+9).at n=29A001535
• Number of (n+6)X1 arrays of occupancy after each element moves up to +-6 places but not 0 and without 2-loops.at n=3A222164
• T(n,k)=Number of length (n+k)X1 arrays of occupancy after each element moves up to +-k places but not 0 and without 2-loops.at n=39A222165
• Number of nX3 0..1 arrays with every element equal to 0, 1 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=9A301879
• Number of nX4 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=4A316818
• Number of nX5 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=3A316819
• T(n,k) = Number of n X k 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=31A316822
• T(n,k) = Number of n X k 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=32A316822
• Numbers k such that k and k+1 have at least 4 but not both exactly 4 distinct prime factors.at n=20A321494