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.

A205148 Least s(k) such that n divides s(k)-s(j) for some j where s(j)=prime(j)*prime(j+1).

This page as a plain text file.
%I A205148 #5 Mar 30 2012 18:58:10
%S A205148 15,35,15,35,35,77,77,143,15,35,143,143,221,77,323,143,323,143,437,35,
%T A205148 77,143,667,221,1517,221,143,323,35,323,77,143,143,323,2491,143,1517,
%U A205148 437,221,437,323,77,221,323,323,667,899,221,437,1517,323,899
%N A205148 Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=prime(j)*prime(j+1).
%C A205148 For a guide to related sequences, see A204892.
%t A205148 (See the program at A205146.)
%Y A205148 Cf. A205146, A204892.
%K A205148 nonn
%O A205148 1,1
%A A205148 _Clark Kimberling_, Jan 25 2012