[seqfan] Sum 1/p log p

Charles Greathouse charles.greathouse at case.edu
Mon Mar 26 08:43:42 CEST 2012

Erdos (1989) conjectured that if a(1), a(2), ... is a sequence where
no term divides another, the sum of 1/(a(n) log a(n)) is at most sum
1/(p log p).  Is this constant in the OEIS? Is there a good way to
calculate it to high precision?

Charles Greathouse
Case Western Reserve University

More information about the SeqFan mailing list