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!)
A293682 a(n) = least odd number k > 1 such that p = prime(n) is the middle of k consecutive primes which have arithmetic mean p, or 1 if no such k exists. 0

%I #17 Mar 01 2024 02:05:38

%S 1,1,3,1,1,1,7,1,1,15,1,17,1,1,1,3,1,1,1,13,1,5,1,11,1,1,1,1,1,1,1,1,

%T 37,1,51,17,3,1,1,3,33,1,1,7,1,1,3,1,67,7,1,1,1,1,3,3,1,1,1,5,1,1,1,1,

%U 1,1,1,1,1,5,23,37,1,3,1,35,1,13,1,13,99,11,1

%N a(n) = least odd number k > 1 such that p = prime(n) is the middle of k consecutive primes which have arithmetic mean p, or 1 if no such k exists.

%e There are no primes before prime(1) so a(1) = 1.

%e a(3) = 3 as prime(3) = 5, which is the arithmetic mean of the three consecutive primes {3, 5, 7}.

%o (PARI) a(n) = {my(s = pprev = pnxt = p = prime(n), q=1); for(i=1, n-1, pprev = precprime(pprev - 1); pnxt = nextprime(pnxt + 1); s += (pprev + pnxt); q += 2; if(p * q == s, return(q))); return(1)}

%Y Cf. A006562, A034964, A122535, A293395.

%K nonn

%O 1,3

%A _David A. Corneth_, Oct 14 2017

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 April 23 14:32 EDT 2024. Contains 371914 sequences. (Running on oeis4.)