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.

A102664 Lexically least sequence of distinct positive integers such that for all j and k, 1+a(j)-a(k) is 0, 1 or not a square.

This page as a plain text file.
%I A102664 #5 Oct 19 2017 03:14:39
%S A102664 1,2,3,7,8,12,13,14,19,24,30,35,40,41,46,52,53,57,58,63,69,74,79,80,
%T A102664 85,86,90,91,96,97,108,119,124,130,135,136,141,147,158,163,164,174,
%U A102664 186,191,213,224,245,288,297,299,316,322,327,338,339,349,350,355,366,383,389
%N A102664 Lexically least sequence of distinct positive integers such that for all j and k, 1+a(j)-a(k) is 0, 1 or not a square.
%C A102664 Build up an array in which the rows are the numbers n^2 + k - 1, where k is the smallest number that has not yet been covered:
%C A102664 1, 4, 9,16,25,...
%C A102664 2, 5,10,17,26,...
%C A102664 3, 6,11,18,27,...
%C A102664 7,10,15,22,...
%C A102664 8,11,16,23,...
%C A102664 12,15,20,27,...
%C A102664 13,16,21,28,...
%C A102664 14,17,22,29,...
%C A102664 19,22,27,...
%C A102664 24,27,...
%C A102664 30,...
%C A102664 Sequence gives first column.
%Y A102664 Cf. A030193.
%K A102664 nonn,easy
%O A102664 1,2
%A A102664 _Brendan McKay_ and _Don Reble_, Jan 27 2005
%E A102664 More terms from _David Wasserman_, Apr 09 2008