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.
a(n)=my(k); while(((Mod([1,1;1,0],n))^k++)[1,2]!=-8, ); k+1 \\ Charles R Greathouse IV, Nov 25 2014
f:= proc(n) local a,b,t,T,k;
b:= 0; a:= 1; T:= -3 mod n;
for k from 1 do
t:= a+b mod n;
if t = T then return k+1 fi;
a:= b; b:= t;
od
end proc:
f(1):= 1: f(3):= 1:
select(n -> f(n) = n+6, [$1..2000]); # Robert Israel, Jun 08 2023
Comments