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.

A205132 Least s(k) such that n divides s(k)-s(j) for some j where s(j)=2*j^2-j, the j-th hexagonal number.

This page as a plain text file.
%I A205132 #9 Apr 09 2015 15:11:46
%S A205132 6,15,15,45,6,45,15,153,15,45,28,66,28,15,45,561,45,91,66,66,66,28,91,
%T A205132 231,91,231,28,231,120,45,153,2145,153,378,120,153,190,66,45,325,231,
%U A205132 276,276,45,91,91,325,630,153,378,66,276,378,120,231,325,120
%N A205132 Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=2*j^2-j, the j-th hexagonal number.
%C A205132 For a guide to related sequences, see A204892.
%t A205132 (See the program at A205130.)
%Y A205132 Cf. A205130, A204892.
%K A205132 nonn
%O A205132 1,1
%A A205132 _Clark Kimberling_, Jan 25 2012