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.

A205017 Least k such that n divides the k-th difference between distinct oblong numbers.

This page as a plain text file.
%I A205017 #6 Feb 27 2013 09:44:10
%S A205017 1,1,3,1,2,3,5,6,4,2,14,8,20,5,13,28,35,4,44,11,26,14,65,8,17,20,16,7,
%T A205017 104,13,119,120,23,35,22,12,170,44,31,11,209,26,230,18,40,65,275,34,
%U A205017 39,17,50,25,350,16,74,49,61,104,434,24
%N A205017 Least k such that n divides the k-th difference between distinct oblong numbers.
%C A205017 For a guide to related sequences, see A204892.
%t A205017 (See the program at A205018.)
%Y A205017 Cf. A205018, A204892.
%K A205017 nonn
%O A205017 1,3
%A A205017 _Clark Kimberling_, Jan 22 2012