|
|
A185066
|
|
Bershadskii's ln-sequence.
|
|
1
|
|
|
7, 14, 28, 35, 49, 55, 69, 87, 94, 112, 126, 133, 147, 165, 183, 190, 207, 221, 228, 246, 260, 278, 299, 313, 320, 333, 340, 354, 381, 394, 412, 419, 442, 449, 467, 485, 499, 517, 535, 542, 565, 572, 586, 592, 617, 642, 656, 663
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Bershadskii: Let us take, as a first step, logarithms of the gaps for the sequence of prime numbers.... Then, let us compute cumulative sum of these logarithms as a second step. Then, we will multiply each value in the cumulative sum by 10 and will replace each of the obtained values by a natural number which is nearest to it.
|
|
LINKS
|
|
|
MAPLE
|
Digits := 20 ; A185066 := proc(n) x := 0 ; for i from 1 to n+1 do x := x+log(ithprime(i+1)-ithprime(i)) ; end do; round(10*x) ; end proc: # R. J. Mathar, Mar 16 2011
|
|
MATHEMATICA
|
Rest[Floor[#+1/2]&/@(10#&/@Accumulate[Log[Differences[Prime[Range[ 100]]]]])] (* Harvey P. Dale, Aug 18 2011 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|