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.

A205878 The least number j such that 10 divides s(k)-s(j), where k(n)=A205877(n) and s(k) denotes the (k+1)-st Fibonacci number.

This page as a plain text file.
%I A205878 #8 Mar 30 2012 18:58:12
%S A205878 3,1,4,8,3,6,13,13,15,8,11,1,7,4,9,1,7,18,13,15,16,5,4,9,19,3,6,12,5,
%T A205878 23,1,7,18,21,10,14,10,28,10,28,30,5,23,26,13,15,16,22,4,9
%N A205878 The least number j such that 10 divides s(k)-s(j), where k(n)=A205877(n) and s(k) denotes the (k+1)-st Fibonacci number.
%C A205878 For a guide to related sequences, see A205840.
%e A205878 (See the example at A205877.)
%t A205878 (See the program at A205877.)
%Y A205878 Cf. A204890, A205877, A205840.
%K A205878 nonn
%O A205878 1,1
%A A205878 _Clark Kimberling_, Feb 02 2012