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 A106292 #15 Feb 16 2025 08:32:57
%S A106292 3,8,4,16,10,28,36,18,48,14,30,76,40,88,32,108,58,60,136,70,148,78,
%T A106292 168,44,196,50,208,72,108,76,256,130,276,46,148,50,316,328,336,348,
%U A106292 178,90,190,388,396,22,42,448,456,114,52,238,240,250,516,176,268,270,556,56
%N A106292 Period of the Lucas sequence A000032 mod prime(n).
%C A106292 This sequence differs from A060305 at only one position: 3, which corresponds to the prime 5, which is the discriminant of the characteristic polynomial x^2-x-1. We have a(n) < prime(n) for the primes in A038872.
%H A106292 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Fibonaccin-StepNumber.html">Fibonacci n-Step Number</a>.
%F A106292 a(n) = A106291(prime(n)).
%t A106292 n=2; Table[p=Prime[i]; a=Join[Table[ -1, {n-1}], {n}]; a=Mod[a, p]; a0=a; k=0; While[k++; s=Mod[Plus@@a, p]; a=RotateLeft[a]; a[[n]]=s; a!=a0]; k, {i, 70}]
%Y A106292 Cf. A060305 (period of Fibonacci numbers mod prime(n)), A106273 (discriminant of the polynomial x^n-x^(n-1)-...-x-1), A106291.
%K A106292 nonn
%O A106292 1,1
%A A106292 _T. D. Noe_, May 02 2005