9557956

Appears in sequences

• a(n) is the smallest integer k > 1 such that k > n * pi(k), where pi() denotes the prime counting function.at n=14A086511
• Place n points in general position on each side of a square, and join every pair of the 4*n+4 boundary points by a chord; sequence gives number of regions in the resulting planar graph.at n=32A367121