A330636 Lexicographically earliest sequence of positive terms such that for any n > 0 and k > 0, a(n+k) <> floor(k/a(n)).

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, 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, 7, 15, 15, 11, 8, 8, 8, 12, 9, 9, 9, 13, 13, 10, 10, 12, 14, 14

Offset

1,2

Links

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Rémy Sigrist, Scatterplot of the first 1000000 terms

Rémy Sigrist, C program for A330636

Example

The first terms, alongside the corresponding forbidden values, are:
  n   a(n)  k=1  k=2  k=3  k=4  k=5  k=6  k=7  k=8  k=9  k=10
  --  ----  ---  ---  ---  ---  ---  ---  ---  ---  ---  ----
   1     1
   2     2    1
   3     1    0    2
   4     2    1    1    3
   5     3    0    2    1    4
   6     4    0    1    3    2    5
   7     3    0    0    1    4    2    6
   8     4    0    0    1    2    5    3    7
   9     4    0    0    0    1    2    6    3    8
  10     2    0    0    1    1    1    3    7    4    9
  11     5    0    0    0    1    1    2    3    8    4    10

Prog

(C) See Links section.

Crossrefs

See A330721 for another variant.

Sequence in context: A360737 A076258 A259576 * A030330 A286579 A293689

Adjacent sequences: A330633 A330634 A330635 * A330637 A330638 A330639

Keyword

nonn

Author

Rémy Sigrist, Dec 22 2019

Status

approved