20790000

Appears in sequences

• a(1)=1. a(n) = the smallest positive multiple of a(n-1) that contains the binary representations of all positive integers <= n at least once each in its binary representation.at n=15A144098
• a(n) is the number of (0,1) matrices A=(a_{ij}) of size n X (4n) such that each row has exactly four 1's and each column has exactly one 1 and with the restriction that no 1 stands on the diagonal from a_{11} to a_{22}.at n=3A173790
• Number of permutations of 1..n with the sequence of sums of 5 adjacent elements having exactly 2 maxima.at n=5A179725
• Triangle read by rows: T(n,k) is the number of labeled forests with n trees and 2n nodes and with the largest tree having exactly k nodes, (n >= 1, 2 <= k <= n+1).at n=18A332959