20293

Appears in sequences

• Consider triangle in which n-th row contains the smallest set of n consecutive numbers whose LCM is divisible by primorial(n) (the product of first n primes). Sequence contains the first column.at n=20A083130
• a(n) = a(n-1) + a(n-2) + 2 where a(0) = a(1) = 1.at n=19A111314
• Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k UUDU's starting at level 0.at n=27A135330
• Diagonal sums of the triangle A132047.at n=19A144707
• Unchanging value maps: number of n X 5 binary arrays indicating the locations of corresponding elements unequal to no king-move neighbor in a random 0..1 n X 5 array.at n=5A219400
• Unchanging value maps: number of nX6 binary arrays indicating the locations of corresponding elements unequal to no king-move neighbor in a random 0..1 nX6 array.at n=4A219401
• T(n,k)=Unchanging value maps: number of nXk binary arrays indicating the locations of corresponding elements unequal to no king-move neighbor in a random 0..1 nXk array.at n=49A219403
• T(n,k)=Unchanging value maps: number of nXk binary arrays indicating the locations of corresponding elements unequal to no king-move neighbor in a random 0..1 nXk array.at n=50A219403
• Number T(n,k) of endofunctions on [n] such that at most k elements with nonempty preimage have equal preimage cardinality and non-equinumerous preimages have cardinalities that differ by at least k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=30A231915
• 21*n^4 - 36*n^3 + 25*n^2 - 8*n + 1.at n=6A239426
• Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) >= number of parts of p.at n=46A241831
• Numbers n such that the digit sum of Fibonacci(n) is equal to the digit sum of Lucas(n).at n=39A244923
• Number of (n+1)X(3+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0001 0101 0111.at n=3A259510
• Number of (n+1)X(4+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0001 0101 0111.at n=2A259511
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0001 0101 0111.at n=17A259515
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0001 0101 0111.at n=18A259515
• Number of compositions of n with weakly increasing differences.at n=33A325546