Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Jan 01 2020 11:24:08
%S 1,2,1,2,3,4,3,4,4,2,5,3,3,4,4,4,5,5,5,6,6,7,7,8,3,9,9,6,4,9,7,7,5,8,
%T 8,4,6,9,12,10,7,13,11,11,8,6,12,15,9,13,7,12,10,17,13,8,11,14,14,10,
%U 7,15,15,11,8,8,8,12,9,9,9,13,13,10,10,12,14,14
%N Lexicographically earliest sequence of positive terms such that for any n > 0 and k > 0, a(n+k) <> floor(k/a(n)).
%H Rémy Sigrist, <a href="/A330636/b330636.txt">Table of n, a(n) for n = 1..10000</a>
%H Rémy Sigrist, <a href="/A330636/a330636.png">Scatterplot of the first 1000000 terms</a>
%H Rémy Sigrist, <a href="/A330636/a330636.txt">C program for A330636</a>
%e The first terms, alongside the corresponding forbidden values, are:
%e n a(n) k=1 k=2 k=3 k=4 k=5 k=6 k=7 k=8 k=9 k=10
%e -- ---- --- --- --- --- --- --- --- --- --- ----
%e 1 1
%e 2 2 1
%e 3 1 0 2
%e 4 2 1 1 3
%e 5 3 0 2 1 4
%e 6 4 0 1 3 2 5
%e 7 3 0 0 1 4 2 6
%e 8 4 0 0 1 2 5 3 7
%e 9 4 0 0 0 1 2 6 3 8
%e 10 2 0 0 1 1 1 3 7 4 9
%e 11 5 0 0 0 1 1 2 3 8 4 10
%o (C) See Links section.
%Y See A330721 for another variant.
%K nonn
%O 1,2
%A _Rémy Sigrist_, Dec 22 2019