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.

A205115 The index j such that n divides s(k)-s(j), where k is the least index (A205114) for which such j exists, and s=(1,3,4,7,11,18...), the Lucas numbers.

This page as a plain text file.
%I A205115 #8 Mar 30 2012 18:58:10
%S A205115 1,1,1,2,1,1,3,2,5,1,4,5,2,3,2,5,1,5,8,4,6,4,1,3,3,2,8,1,6,2,14,4,1,7,
%T A205115 6,5,2,8,3,4,9,2,3,2,4,1,7,4,2,4,5,1,3,8,8,5,12,6,9,2
%N A205115 The index j<k such that n divides s(k)-s(j), where k is the least index (A205114) for which such j exists, and s=(1,3,4,7,11,18...), the Lucas numbers.
%C A205115 For a guide to related sequences, see A204892.
%t A205115 (See the program at A205114.)
%Y A205115 Cf. A205114, A204892.
%K A205115 nonn
%O A205115 1,4
%A A205115 _Clark Kimberling_, Jan 22 2012