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.

A205446 s(k)-s(j), where (k,j) is the least pair for which n divides s(k)-s(j), and s(j)=Fibonacci(2j-1).

This page as a plain text file.
%I A205446 #6 Mar 30 2012 18:58:11
%S A205446 1,4,3,4,55,12,21,8,144,220,11,12,377,84,6765,32,2584,144,76,220,21,
%T A205446 88,46368,144,12586269025,1508,14930352,84,29,27060,1364,32,33,2584,
%U A205446 102334155,144,39088169,76,317811,832040,6765,84,701408733,88
%N A205446 s(k)-s(j), where (k,j) is the least pair for which n divides s(k)-s(j), and s(j)=Fibonacci(2j-1).
%C A205446 For a guide to related sequences, see A204892.
%t A205446 (See the program at A205442.)
%Y A205446 Cf. A205442, A204892.
%K A205446 nonn
%O A205446 1,2
%A A205446 _Clark Kimberling_, Jan 27 2012