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
G. C. Greubel, Table of n, a(n) for n = 1..5000
A. Bershadskii, Hidden periodicity in the sequence of prime numbers, arXiv:1102.3648 [math.NT], 2011.
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
Jonathan Vos Post, Feb 18 2011
STATUS
approved