login
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.
0

%I #5 Oct 19 2017 03:14:39

%S 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 85,86,90,91,96,97,108,119,124,130,135,136,141,147,158,163,164,174,

%U 186,191,213,224,245,288,297,299,316,322,327,338,339,349,350,355,366,383,389

%N 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 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 1, 4, 9,16,25,...

%C 2, 5,10,17,26,...

%C 3, 6,11,18,27,...

%C 7,10,15,22,...

%C 8,11,16,23,...

%C 12,15,20,27,...

%C 13,16,21,28,...

%C 14,17,22,29,...

%C 19,22,27,...

%C 24,27,...

%C 30,...

%C Sequence gives first column.

%Y Cf. A030193.

%K nonn,easy

%O 1,2

%A _Brendan McKay_ and _Don Reble_, Jan 27 2005

%E More terms from _David Wasserman_, Apr 09 2008