24990

Appears in sequences

• Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 1 skipped prime.at n=15A050768
• Triangle read by rows: T(n,k) = number of k-covers of a labeled n-set, k=1..2^n-1.at n=29A055154
• List of codewords in binary lexicode with Hamming distance 7 written as decimal numbers.at n=24A075937
• Integers k such that omega(k) = omega(k-1) + omega(k-2) + omega(k-3), where omega(n) is the number of distinct prime factors of n.at n=17A076252
• Number of 4-block covers of a labeled n-set.at n=2A095153
• a(n) = 7*n*(2*n + 1).at n=42A195026
• Number of n X 7 0..1 arrays avoiding 0 0 1 and 1 0 0 horizontally and 0 0 1 and 1 0 1 vertically.at n=3A209649
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 1 0 0 horizontally and 0 0 1 and 1 0 1 vertically.at n=48A209650
• Number of 4Xn 0..1 arrays avoiding 0 0 1 and 1 0 0 horizontally and 0 0 1 and 1 0 1 vertically.at n=6A209651
• Number of (w,x,y,z) with all terms in {1,...,n} and w<2x and y<=3z.at n=14A212509
• Numbers k with the property that p = k^2 - 11 and q = k^2 + 11 are consecutive primes.at n=37A248790
• a(1)=2310; for n > 1, a(n) is the least integer not occurring earlier such that a(n) shares exactly five distinct prime divisors with a(n-1).at n=35A264718
• Unitary practical numbers that are nonsquarefree.at n=17A287173
• Numbers n for which 2 < A257993(A276086(A276086(n))) < A257993(n), where A276086 converts the primorial base expansion of n into its prime product form, and A257993 returns the index of the least prime not present in its argument.at n=15A328762
• a(n) is the least number k such that there are exactly n pairs (p,q) of primes with p<q such that p+q = 2*k and that 2*k+p, 2*k+q, p*q-2*k and p*q+2*k are primes.at n=13A354462
• Numbers k such that omega(k) = 5 and the largest prime factor of k equals the sum of its remaining distinct prime factors, where omega(k) = A001221(k).at n=14A383729