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.

A205116 Least s(k) such that n divides s(k)-s(j) for some j where s(j)=is the j-th Lucas number.

This page as a plain text file.
%I A205116 #9 Apr 09 2015 15:42:17
%S A205116 3,3,4,7,11,7,11,11,29,11,18,47,29,18,18,123,18,29,123,47,123,29,47,
%T A205116 76,29,29,2207,29,47,123,2207,199,199,199,123,47,521,123,199,47,199,
%U A205116 843,47,47,322,47,76,199,199,2207,521,521,322,2207,322,123,3571
%N A205116 Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=is the j-th Lucas number.
%C A205116 For a guide to related sequences, see A204892.
%t A205116 (See the program at A205114.)
%Y A205116 Cf. A205114, A204892.
%K A205116 nonn
%O A205116 1,1
%A A205116 _Clark Kimberling_, Jan 22 2012