|
%I #10 Jan 01 2020 11:23:48
%S 1,2,1,2,1,2,1,2,1,2,3,2,3,2,2,2,2,4,2,3,2,3,2,3,2,3,3,3,3,3,3,3,3,2,
%T 3,2,3,2,3,4,3,4,2,4,2,4,3,4,3,4,2,4,2,3,2,3,2,3,4,3,4,3,4,4,4,5,3,5,
%U 3,5,3,2,3,2,3,3,3,3,5,3,5,3,5,3,5,3,2
%N Lexicographically earliest sequence of positive terms such that for any n > 0 and k > 0, a(n+k^2) <> floor(k/a(n)).
%C This sequence is a variant of A330636.
%H Rémy Sigrist, <a href="/A330721/b330721.txt">Table of n, a(n) for n = 1..10000</a>
%H Rémy Sigrist, <a href="/A330721/a330721.png">Scatterplot of the ordinal transform of the first 1000000 terms</a>
%H Rémy Sigrist, <a href="/A330721/a330721.txt">C program for A330721</a>
%e The first terms, alongside the corresponding forbidden values, are:
%e n a(n) k=1 k=2 k=3
%e -- ---- --- --- ---
%e 1 1
%e 2 2 1
%e 3 1 0
%e 4 2 1
%e 5 1 0 2
%e 6 2 1 1
%e 7 1 0 2
%e 8 2 1 1
%e 9 1 0 2
%e 10 2 1 1 3
%e 11 3 0 2 1
%e 12 2 0 1 3
%o (C) See Links section.
%Y Cf. A330636.
%K nonn
%O 1,2
%A _Rémy Sigrist_, Dec 28 2019
|
