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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A205153 Least k such that n divides s(k)-s(j) for some j<k, where s(j)=(prime(j+1) + prime(j+2))/2. 9

%I #6 Mar 30 2012 18:58:10

%S 2,2,3,4,3,4,6,4,5,8,5,6,9,6,7,10,7,9,10,8,9,8,14,9,10,9,11,10,14,10,

%T 20,14,11,16,11,12,20,12,13,22,13,16,17,14,16,14,15,16,17,15,16,15,30,

%U 16,17,16,18,17,23,17,20,31,18,20,18,19,20,19,21,20,22,20,24

%N Least k such that n divides s(k)-s(j) for some j<k, where s(j)=(prime(j+1) + prime(j+2))/2.

%C See A204892 for a discussion and guide to related sequences.

%t s[n_] := s[n] = (Prime[n + 1] + Prime[n + 2])/2; z1 = 1100; z2 = 80;

%t Table[s[n], {n, 1, 30}] (* A024675 *)

%t u[m_] := u[m] = Flatten[Table[s[k] - s[j], {k, 2, z1}, {j, 1, k - 1}]][[m]]

%t Table[u[m], {m, 1, z1}] (* A204980 *)

%t v[n_, h_] := v[n, h] = If[IntegerQ[u[h]/n], h, 0]

%t w[n_] := w[n] = Table[v[n, h], {h, 1, z1}]

%t d[n_] := d[n] = First[Delete[w[n], Position[w[n], 0]]]

%t Table[d[n], {n, 1, z2}] (* A205152 *)

%t k[n_] := k[n] = Floor[(3 + Sqrt[8 d[n] - 1])/2]

%t m[n_] := m[n] = Floor[(-1 + Sqrt[8 n - 7])/2]

%t j[n_] := j[n] = d[n] - m[d[n]] (m[d[n]] + 1)/2

%t Table[k[n], {n, 1, z2}] (* A205153 *)

%t Table[j[n], {n, 1, z2}] (* A205154 *)

%t Table[s[k[n]], {n, 1, z2}] (* A205372 *)

%t Table[s[j[n]], {n, 1, z2}] (* A205373 *)

%t Table[s[k[n]] - s[j[n]], {n, 1, z2}] (* A205374 *)

%t Table[(s[k[n]] - s[j[n]])/n, {n, 1, z2}] (* A205375 *)

%Y Cf. A024675, A204892, A205375.

%K nonn

%O 1,1

%A _Clark Kimberling_, Jan 26 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | 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 May 3 10:32 EDT 2024. Contains 372207 sequences. (Running on oeis4.)