login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


2

%I #5 Mar 30 2012 18:58:12

%S 1,2,2,2,2,1,3,2,2,1,3,1,2,2,3,1,2,2,1,3,2,2,1,2,3,2,2,2,2,2,1,2,2,3,

%T 2,2,1,2,3,2,1,2,2,2,2,2,2,1,2,3,2,2,2,1,3,2,2,2,2,2,2,1,2,2,2,3,2,1,

%U 2,2,3,1,2,2,1,2,3,2,2,2,1,2,3,2,1,2,2,3,2,2,1,2,2,3,2,2,2,2,1

%N A206818(n+1)-A206818(n).

%C The sequences A206815, A206818, A207384, A207835 illustrate the closeness of {j+pi(j)} to {k+(k+1)/log(k+1)}, as suggested by the prime number theorem and the conjecture that all the terms of A207384 and A207835 are in the set {1,2,3}.

%e The joint ranking is represented by

%e 1 < 3 < 3.8 < 4.7 < 5 < 5.8 < 6 <7.1 < 8 < 8.3 < 9 < ...

%e Positions of numbers j+pi(j): 1,2,5,7,9,...

%e Positions of numbers k+(k+1)/log(k+1): 3,4,6,8,10,..

%t f[1, n_] := n + PrimePi[n];

%t f[2, n_] := n + N[(n + 1)/Log[n + 1]]; z = 500;

%t t[k_] := Table[f[k, n], {n, 1, z}];

%t t = Sort[Union[t[1], t[2]]];

%t p[k_, n_] := Position[t, f[k, n]];

%t Flatten[Table[p[1, n], {n, 1, z}]] (* A206815 *)

%t Flatten[Table[p[2, n], {n, 1, z}]] (* A206818 *)

%t d1[n_] := p[1, n + 1] - p[1, n]

%t Flatten[Table[d1[n], {n, 1, z - 1}]] (* A207385 *)

%t d2[n_] := p[2, n + 1] - p[2, n]

%t Flatten[Table[d2[n], {n, 1, z - 1}]] (* A207386 *)

%Y Cf. A000720, A206815, A206818.

%K nonn

%O 1,2

%A _Clark Kimberling_, Feb 17 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 24 06:21 EDT 2024. Contains 376187 sequences. (Running on oeis4.)