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.

A205444 Least s(k) such that n divides s(k)-s(j) for some j where s(j)=Fibonacci(2j-1).

This page as a plain text file.
%I A205444 #5 Mar 30 2012 18:58:11
%S A205444 2,5,5,5,89,13,34,13,233,233,13,13,610,89,10946,34,4181,233,89,233,34,
%T A205444 89,75025,233,20365011074,1597,24157817,89,34,28657,1597,34,34,4181,
%U A205444 165580141,233,63245986,89,514229,1346269,10946,89,1134903170
%N A205444 Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=Fibonacci(2j-1).
%C A205444 For a guide to related sequences, see A204892.
%t A205444 (See the program at A205442.)
%Y A205444 Cf. A205442, A204892.
%K A205444 nonn
%O A205444 1,1
%A A205444 _Clark Kimberling_, Jan 27 2012