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.

A204893 The index j such that n divides s(k)-s(j), where k is the least index (A204892) for which such j exists, and s(k)=prime(k).

This page as a plain text file.
%I A204893 #8 Mar 30 2012 18:58:08
%S A204893 1,2,1,2,1,3,2,2,1,2,1,3,2,2,1,2,1,3,2,2,1,4,4,3,2,2,1,2,1,4,3,3,3,2,
%T A204893 1,3,3,2,1,2,1,3,2,2,1,4,2,3,2,2,1,4,2,3,2,2,1,2,1,4,3,3,3,2,1,3,2,2,
%U A204893 1,2
%N A204893 The index j<k such that n divides s(k)-s(j), where k is the least index (A204892) for which such j exists, and s(k)=prime(k).
%C A204893 For a guide to related sequences, see A204892.
%t A204893 (See the program at A204892.)
%Y A204893 Cf. A204892.
%K A204893 nonn
%O A204893 1,2
%A A204893 _Clark Kimberling_, Jan 20 2012