2448975

Appears in sequences

• a(n) is the smallest number m such that np(m) = n, where np(m) is number of primes p such that prime(m) < p < prime(m)^(1 + 1/m).at n=30A246810
• Number of times an odious number is encountered when iterating from 2^(n+1)-2 to (2^n)-2 with the map x -> x - (number of runs in binary representation of x).at n=26A255064