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.

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

This page as a plain text file.
%I A205452 #5 Mar 30 2012 18:58:11
%S A205452 3,3,21,21,8,21,8,144,21,21,144,987,21,377,46368,2584,55,21,6765,21,
%T A205452 987,377,377,987,121393,55,55,2584,987,317811,2178309,832040,46368,55,
%U A205452 17711,46368,6765,6765,2178309,2584,144,987,46368,2178309,317811
%N A205452 Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=Fibonacci(2j).
%C A205452 For a guide to related sequences, see A204892.
%t A205452 (See the program at A205450.)
%Y A205452 Cf. A205450, A204892.
%K A205452 nonn
%O A205452 1,1
%A A205452 _Clark Kimberling_, Jan 27 2012