|
| |
|
|
A089657
|
|
Let g[n]=Floor[Prime[n]-n)/((n-PrimePi[n])], then a(n) = Floor[(Prime[n]+g[n]*PrimePi[n])/(1+g[n]).
|
|
0
| |
|
|
1, 2, 3, 4, 5, 6, 7, 9, 10, 10, 11, 13, 13, 15, 16, 17, 17, 20, 19, 20, 21, 22, 23, 25, 26, 27, 27, 28, 29, 30, 34, 35, 36, 36, 38, 39, 41, 42, 43, 44, 46, 46, 43, 49, 50, 51, 47, 49, 50, 50, 51, 52, 53, 55, 56, 57, 58, 58, 60, 61, 62, 63, 66, 66, 67, 67, 71, 72, 73, 74, 75, 76
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| A chop-chop broken line function using the weighted average function of primes and their distribution that is log like. When the floors are left out it reproduces n exactly: the two uses of Floor[] functions chop it twice to give a broken line that is chaotic.
|
|
|
MATHEMATICA
| g[n_] = Floor[(Prime[n] - n)/(n - PrimePi[n])]; digits = 200; a = Table[Floor[(Prime[n] + g[n]*PrimePi[n])/(1 + g[n])], {n, 1, digits}]
|
|
|
CROSSREFS
| Sequence in context: A083047 A191737 A161659 * A004727 A102352 A007412
Adjacent sequences: A089654 A089655 A089656 * A089658 A089659 A089660
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jan 04 2004
|
|
|
EXTENSIONS
| Edited by N. J. A. Sloane (njas(AT)research.att.com), Apr 28 2006
|
| |
|
|
