41503

Appears in sequences

• Numbers of the form 7^i*11^j.at n=17A003599
• Number of {0,1} n X n matrices with no zero rows or columns.at n=4A048291
• Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n.at n=19A057290
• Numbers that factorize into a prime number of factors all raised to different prime exponents and no number appears both as an exponent and as a prime factor.at n=12A114131
• Numbers which can be expressed as the product of numbers made of only sevens.at n=15A161145
• Triangle read by rows: T(n,m) = number of n X m binary matrices with no zero rows or columns (n >= 1, 1 <= m <= n).at n=9A183109
• Number of (n+3)X(n+3) binary arrays with no more than three of any consecutive four bits set in any row or column.at n=0A202718
• Number of (n+3)X4 binary arrays with no more than three of any consecutive four bits set in any row or column.at n=0A202719
• T(n,k)=Number of (n+3)X(k+3) binary arrays with no more than three of any consecutive four bits set in any row or column.at n=0A202726
• Square array A(h,k) = (2^h-1)*A(h,k-1) + Sum_{i=1..h-1} binomial(h,h-i)*2^i*A(i,k-1), with A(1,k) = A(h,1) = 1; read by antidiagonals.at n=24A218695
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 785", based on the 5-celled von Neumann neighborhood.at n=35A273559
• Triangle read by rows: T(n,k) = number of n X n (0,1) matrices with at most k 1's in each row or column.at n=8A283500
• Number of edge covers in the n-folded cube graph.at n=2A297052
• Heinz numbers of integer partitions such that the difference between the length of the minimal square containing and the maximal square contained in the Young diagram is 1.at n=44A325179
• a(n) is the first occurrence of n in A334200.at n=22A334199
• a(n) = gcd(A324886(n), A064989(A324886(n))).at n=74A346095
• Powerful numbers k that are not prime powers such that there exist no numbers m such that rad(m) | k and Omega(m) > Omega(k), where rad = A007947 and Omega = A001222.at n=16A377591
• Integers k such that k = Sum k/(p_i + j), where p_i are the prime factors of k (with multiplicity). Case j = -3.at n=6A380923
• Odd Achilles numbers.at n=30A390953
• a(n) is the conjectured largest number such that both a(n) and a(n) - n are 11-smooth numbers, or 0 if no such number exists. a(n) can be less than n.at n=30A392256