A330623 -id:A330623 - cp's OEIS frontend

A330267 Lexicographically earliest sequence of nonnegative terms such that for any n > 0 and k > 0, a(n+2*k) <> max(a(n), a(n+k)).

0, 0, 1, 0, 0, 1, 2, 3, 4, 0, 0, 1, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 2, 3, 10, 11, 0, 0, 1, 0, 0, 1, 12, 13, 4, 0, 0, 1, 0, 0, 1, 6, 5, 4, 7, 8, 9, 14, 15, 6, 16, 10, 5, 17, 11, 10, 7, 8, 3, 2, 5, 2, 3, 18, 19, 20, 21, 3, 2, 12, 2, 3, 13, 22, 2, 11, 2, 10, 23

Offset: 1

Rémy Sigrist, Dec 21 2019

nonn

Rémy Sigrist, Table of n, a(n) for n = 1..10000
Rémy Sigrist, Scatterplot of the first 250000 terms
Rémy Sigrist, C program for A330267

Cf. A003278 (positions of 0's).
See A229037, A268811, A276204, A309890, A317805, A361933, A364057 for similar sequences.
See A330622, A330623 and A330629 for other variants.

C
```
See Links section.
```

a(n) = 0 iff n belongs to A003278.

A330622 Lexicographically earliest sequence of nonnegative terms such that for any n > 0 and k > 0, a(n+2*k) <> gcd(a(n), a(n+k)).

Original entry on oeis.org

0, 0, 1, 0, 0, 1, 2, 2, 3, 0, 0, 3, 0, 0, 4, 2, 5, 3, 5, 6, 3, 4, 4, 6, 6, 5, 4, 0, 0, 7, 0, 0, 7, 8, 8, 9, 0, 0, 7, 0, 0, 3, 8, 5, 3, 5, 9, 9, 5, 8, 7, 9, 2, 7, 10, 4, 3, 10, 6, 7, 6, 10, 10, 6, 6, 4, 10, 4, 9, 6, 11, 6, 6, 8, 11, 5, 8, 8, 4, 10, 11, 0, 0, 7

Offset: 1

Rémy Sigrist, Dec 21 2019

nonn

This sequence differs radically from the variant where we consider only positive terms (A330623).

Rémy Sigrist, Table of n, a(n) for n = 1..10000
Rémy Sigrist, Scatterplot of the first 250000 terms
Rémy Sigrist, C program for A330622

Cf. A003278 (positions of 0's), A330623 (positive variant).

See A330267 for similar sequences.

C
```
See Links section.
```

a(n) = 0 iff n belongs to A003278.

cp's OEIS Frontend

A330267 Lexicographically earliest sequence of nonnegative terms such that for any n > 0 and k > 0, a(n+2*k) <> max(a(n), a(n+k)).

Views

Author

Keywords

Links

Crossrefs

Programs

C

Formula