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.
%I A106300 #14 Feb 16 2025 08:32:57
%S A106300 2789,3847,4451,4751,5431,6203,8317,9533,9629,9907,10093,11839,13903,
%T A106300 13907,14207,15823,16319,16759,19543,20939,21379,21859,25303,26683,
%U A106300 29483,30871,31267,31699,32003,32771,33967,34963,36229,37061,39983
%N A106300 Primes that do not divide any term of the Lucas 4-step sequence A073817.
%C A106300 If a prime p divides a term a(k) of this sequence, then k must be less than the period of the sequence mod p. Hence these primes are found by computing A073817(k) mod p for increasing k and stopping when either A073817(k) mod p = 0 or the end of the period is reached. Interestingly, for all of these primes, the period of the sequence A073817(k) mod p appears to be (p-1)/d, where d is a small integer.
%H A106300 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Fibonaccin-StepNumber.html">Fibonacci n-Step Number</a>.
%t A106300 n=4; lst={}; Table[p=Prime[i]; a=Join[Table[ -1, {n-1}], {n}]; a=Mod[a, p]; a0=a; While[s=Mod[Plus@@a, p]; a=RotateLeft[a]; a[[n]]=s; !(a==a0 || s==0)]; If[s>0, AppendTo[lst, p]], {i, 10000}]; lst
%Y A106300 Cf. A053028 (primes not dividing any Lucas number), A106299 (primes not dividing any Lucas 3-step number), A106301 (primes not dividing any Lucas 5-step number).
%K A106300 nonn
%O A106300 1,1
%A A106300 _T. D. Noe_, May 02 2005