A330267 -id:A330267 - cp's OEIS frontend

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)).

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.

A330623 Lexicographically earliest sequence of positive 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

1, 1, 2, 2, 3, 2, 2, 3, 3, 4, 4, 2, 4, 3, 3, 5, 3, 3, 4, 4, 5, 4, 4, 2, 5, 6, 2, 5, 6, 3, 6, 4, 3, 6, 6, 5, 4, 4, 3, 4, 5, 5, 6, 7, 5, 4, 4, 6, 4, 4, 7, 5, 5, 6, 5, 6, 7, 8, 4, 5, 7, 7, 6, 7, 8, 6, 3, 6, 7, 8, 5, 5, 8, 3, 6, 9, 5, 8, 7, 5, 9, 7, 7, 8, 6, 5, 8

Offset: 1

Rémy Sigrist, Dec 21 2019

nonn

This sequence differs radically from the variant where we consider nonnegative terms (A330622).

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 A330623

Cf. A330622 (nonnegative variant).

See A330267 for similar sequences.

C
```
See Links section.
```

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

Original entry on oeis.org

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

Offset: 1

Rémy Sigrist, Dec 21 2019

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 A330629
Index entries related to non-averaging sequences

See A330267 for similar sequences.

C
```
See Links section.
```

cp's OEIS Frontend

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)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

C

Formula

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

C

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

Views

Author

Keywords

Links

Crossrefs

Programs

C