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!)
A113194 Numbers n such that Lucas(n)-Lucas(i) is composite for i=0..n-3. 8

%I

%S 5,7,10,17,19,23,29,31,34,41,44,49,53,55,57,62,67,68,71,75,77,79,80,

%T 87,89,93,98,100,101,103,107,109,110,116,122,124,125,133,134,135,136,

%U 143,147,154,155,160,161,164,167,170,173,177,180,184,185,188,190,194,196

%N Numbers n such that Lucas(n)-Lucas(i) is composite for i=0..n-3.

%C These are the n such that A113193(n)=0.

%t lst={}; Do[i=0; While[i<n-2 && !PrimeQ[Lucas[n]-Lucas[i]], i++ ]; If[i==n-2, AppendTo[lst, n]], {n, 3, 250}]; lst

%Y Cf. A113192 (primes that are the difference of two Lucas numbers).

%K nonn

%O 1,1

%A _T. D. Noe_, Oct 17 2005

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 August 14 12:27 EDT 2020. Contains 336480 sequences. (Running on oeis4.)