login
A089680
Let g[n_]=(Prime[n]-n)/(n-PrimePi[n]). Then a(n) = Floor[Exp[((g[n]+g[n+1])-g[n*(n+1)]+1)/1.5]].
0
3, 3, 1, 2, 4, 3, 3, 1, 2, 2, 3, 4, 4, 2, 2, 3, 4, 4, 4, 3, 2, 3, 3, 3, 3, 3, 2, 2, 2, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 3, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 3
OFFSET
1,1
COMMENTS
Exponential version of log like weighted average function of primes and the prime distribution.
MATHEMATICA
digits=200 g[n_]=(Prime[n]-n)/(n-PrimePi[n]) b=Table[Floor[Exp[((g[n]+g[n+1])-g[n*(n+1)]+1)/1.5]], {n, 1, digits}]
CROSSREFS
Sequence in context: A255941 A010264 A262816 * A309507 A306690 A160326
KEYWORD
nonn
AUTHOR
Roger L. Bagula, Jan 04 2004
STATUS
approved