A330721 - OEIS

A330721

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

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, 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, 3, 5, 3, 2, 3, 2, 3, 3, 3, 3, 5, 3, 5, 3, 5, 3, 5, 3, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

This sequence is a variant of A330636.

LINKS

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

Rémy Sigrist, Scatterplot of the ordinal transform of the first 1000000 terms

Rémy Sigrist, C program for A330721

EXAMPLE

The first terms, alongside the corresponding forbidden values, are:

n a(n) k=1 k=2 k=3