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.

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

This page as a plain text file.
%I A205141 #8 Mar 30 2012 18:58:10
%S A205141 1,1,1,1,12,5,5,35,1,12,1,22,22,22,5,35,5,1,51,12,1,70,12,22,1,117,1,
%T A205141 5,22,5,145,651,51,1,35,1,210,287,12,12,51,92,287,22,22,5,70,22,51,1,
%U A205141 145,70,92,5,35,5,35,12,117,210
%N A205141 The number s(j) such that n divides s(k)-s(j), where s(j)=j*(3*j-1) and k is the least positive integer for which such a j exists.
%C A205141 For a guide to related sequences, see A204892.
%t A205141 (See the program at A205138.)
%Y A205141 Cf. A205138, A204892.
%K A205141 nonn
%O A205141 1,5
%A A205141 _Clark Kimberling_, Jan 25 2012