59010

Appears in sequences

• Write 0, 1, ..., n in binary and add as if they were decimal numbers.at n=20A067894
• a(n) is the smallest k such that the sum of the first k terms of the composite-harmonic series, Sum_{j=1..k} 1/(j-th composite), is > n.at n=7A074631
• Numbers k having exactly 5 distinct prime factors, the largest of which is greater than or equal to sqrt(k) (i.e., sqrt(k)-rough numbers with exactly 5 distinct prime factors).at n=13A115959
• a(n) = n*(n+1)*(8*n + 1)/6.at n=35A132124
• Triangle T(n, k) read by rows: row n gives the coefficients of the numerator polynomials of the o.g.f. of the (n+1)-th diagonal of the Sheffer triangle A154537 (S2[2,1] generalized Stirling2), for n >= 0.at n=46A290315
• 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=39A328762
• Products of 5 distinct primes that are sandwiched between twin prime numbers.at n=43A376380
• Numbers k such that the sum of the proper divisors of k that have the same binary weight as k is larger than k, and no subset of these divisors sums to k.at n=34A381071