cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A113194 Numbers k such that Lucas(k) - Lucas(i) is composite for i=0..k-3.

This page as a plain text file.
%I A113194 #12 Jan 19 2023 11:10:06
%S A113194 5,7,10,17,19,23,29,31,34,41,44,49,53,55,57,62,67,68,71,75,77,79,80,
%T A113194 87,89,93,98,100,101,103,107,109,110,116,122,124,125,133,134,135,136,
%U A113194 143,147,154,155,160,161,164,167,170,173,177,180,184,185,188,190,194,196
%N A113194 Numbers k such that Lucas(k) - Lucas(i) is composite for i=0..k-3.
%C A113194 These are the numbers k such that A113193(k) = 0.
%H A113194 Robert Israel, <a href="/A113194/b113194.txt">Table of n, a(n) for n = 1..2600</a>
%p A113194 Luc:= 2,1,3: R:= NULL: count:= 0:
%p A113194 a:= 1: b:= 3:
%p A113194 for n from 3 while count < 100 do
%p A113194   c:= a+b; a:= b; b:=c; Luc:= Luc,c;
%p A113194   if ormap(isprime, [seq(c-Luc[i],i=1..n-2)]) then next fi;
%p A113194   R:= R, n; count:= count+1;
%p A113194 od:
%p A113194 R; # _Robert Israel_, Jan 18 2023
%t A113194 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 A113194 Cf. A000032, A113192 (primes that are the difference of two Lucas numbers).
%Y A113194 Cf. A113193.
%K A113194 nonn
%O A113194 1,1
%A A113194 _T. D. Noe_, Oct 17 2005