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.

A205149 The number s(j) such that n divides s(k)-s(j), where s(j)=prime(j)*prime(j+1) and k is the least positive integer for which such a j exists.

This page as a plain text file.
%I A205149 #8 Mar 30 2012 18:58:10
%S A205149 6,15,6,15,15,35,35,15,6,15,77,35,143,35,143,15,221,35,323,15,35,77,
%T A205149 437,77,667,143,35,15,6,143,15,15,77,221,6,35,1147,323,143,77,77,35,6,
%U A205149 15,143,437,6,77,143,667,221,15,2491,35,1147,1147,323,667,77
%N A205149 The number s(j) such that n divides s(k)-s(j), where s(j)=prime(j)*prime(j+1) and k is the least positive integer for which such a j exists.
%C A205149 For a guide to related sequences, see A204892.
%t A205149 (See the program at A205146.)
%Y A205149 Cf. A205146, A204892.
%K A205149 nonn
%O A205149 1,1
%A A205149 _Clark Kimberling_, Jan 25 2012