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.

A205031 s(k)-s(j), where (s(k),s(j)) is the least pair of oblong numbers for which n divides their difference.

This page as a plain text file.
%I A205031 #5 Mar 30 2012 18:58:10
%S A205031 4,4,6,4,10,6,14,8,18,10,22,24,26,14,30,16,34,18,38,40,42,22,46,24,50,
%T A205031 26,54,28,58,30,62,32,66,34,70,36,74,38,78,40,82,42,86,44,90,46,94,48,
%U A205031 98,50,102,52,106,54,110,112,114,58,118,60
%N A205031 s(k)-s(j), where (s(k),s(j)) is the least pair of oblong numbers for which n divides their difference.
%C A205031 For a guide to related sequences, see A204892.
%t A205031 (See the program at A205018.)
%Y A205031 Cf. A205018, A204892.
%K A205031 nonn
%O A205031 1,1
%A A205031 _Clark Kimberling_, Jan 22 2012