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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A113193 Number of times that Lucas(n)-Lucas(i) is prime for i=0..n-3. 2
 1, 1, 0, 1, 0, 1, 1, 0, 2, 2, 1, 1, 1, 2, 0, 1, 0, 1, 3, 1, 0, 2, 2, 1, 3, 1, 0, 1, 0, 3, 3, 0, 1, 2, 1, 1, 2, 1, 0, 2, 1, 0, 4, 2, 1, 3, 0, 1, 2, 1, 0, 1, 0, 2, 0, 1, 2, 1, 3, 0, 2, 1, 2, 1, 0, 0, 2, 3, 0, 1, 1, 3, 0, 1, 0, 1, 0, 0, 4, 1, 1, 1, 2, 1, 0, 1, 0, 3, 1, 1, 0, 2, 4, 1, 1, 0, 3, 0, 0, 5, 0, 1, 2, 1, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,9 COMMENTS We exclude i=n-2 and i=n-1 because they yield Lucas(n-2) and Lucas(n-1), respectively. Sequence A113194 lists the n for which a(n)=0. LINKS MATHEMATICA Lucas[n_] := Fibonacci[n+1]+Fibonacci[n-1]; Table[cnt=0; Do[If[PrimeQ[Lucas[n]-Lucas[i]], cnt++ ], {i, 0, n-3}]; cnt, {n, 3, 150}] CROSSREFS Cf. A113192 (primes that are the difference of two Lucas numbers). Sequence in context: A307090 A347630 A079674 * A239110 A278514 A243840 Adjacent sequences:  A113190 A113191 A113192 * A113194 A113195 A113196 KEYWORD nonn AUTHOR T. D. Noe, Oct 17 2005 STATUS approved

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.

Last modified August 9 15:33 EDT 2022. Contains 356026 sequences. (Running on oeis4.)