login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126233 Smallest number k such that (prime(k+1)+prime(k))/2 is odd and divisible by n-th odd prime. 8

%I

%S 4,6,8,25,12,88,78,19,121,24,29,46,31,126,186,153,156,379,197,139,280,

%T 132,285,380,155,63,334,1005,203,75,77,516,314,445,87,1075,93,95,1872,

%U 254,697,1201,270,425,429,447,304,2187,124,488,1153,128,335,136,547,742

%N Smallest number k such that (prime(k+1)+prime(k))/2 is odd and divisible by n-th odd prime.

%H Amiram Eldar, <a href="/A126233/b126233.txt">Table of n, a(n) for n = 1..10000</a>

%t f[n_] := Block[{k = 1, c},While[c = (Prime[k + 1] + Prime[k])/2; Mod[c, 2] == 0 || Mod[c, Prime[n + 1]] > 0, k++ ];k];Table[f[n], {n, 56}] (* _Ray Chandler_, Jan 09 2007 *)

%Y Cf. A072569, A072572, A072573, A126228, A126229, A126230, A124619, A124620, A126231, A124622.

%K nonn

%O 1,1

%A _Artur Jasinski_, Dec 21 2006

%E Edited and extended by _Ray Chandler_, Jan 09 2007

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 4 07:10 EST 2021. Contains 341781 sequences. (Running on oeis4.)