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!)
A205148 Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=prime(j)*prime(j+1). 2

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

%S 15,35,15,35,35,77,77,143,15,35,143,143,221,77,323,143,323,143,437,35,

%T 77,143,667,221,1517,221,143,323,35,323,77,143,143,323,2491,143,1517,

%U 437,221,437,323,77,221,323,323,667,899,221,437,1517,323,899

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

%C For a guide to related sequences, see A204892.

%t (See the program at A205146.)

%Y Cf. A205146, A204892.

%K nonn

%O 1,1

%A _Clark Kimberling_, Jan 25 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 April 25 11:30 EDT 2024. Contains 371967 sequences. (Running on oeis4.)