A350226 -id:A350226 - cp's OEIS frontend

A350235 a(n) is the least k such that A350226(k) = n.

0, 2, 6, 9, 12, 15, 18, 56, 72, 135, 150, 165, 180, 195, 210, 225, 240, 255, 270, 620, 651, 682, 713, 744, 775, 806, 837, 868, 899, 930, 961, 992, 1056, 2079, 2142, 2205, 2268, 2331, 2394, 2457, 2520, 2583, 2646, 2709, 2772, 2835, 2898, 2961, 3024, 3087, 3150

Offset: 1

Rémy Sigrist, Dec 21 2021

nonn

Equivalently, this sequence gives the positions of records in A350226.

Rémy Sigrist, Table of n, a(n) for n = 1..4099
Rémy Sigrist, C program for A350235

Cf. A350226.

C
```
See Links section.
```

A350285 a(n) is the least d > 0 such that A010060(n) = A010060(n - i*d) for i = 0..A350226(n)-1 (A010060 corresponds to the Thue-Morse sequence).

Original entry on oeis.org

1, 1, 1, 3, 2, 2, 3, 3, 1, 3, 5, 3, 3, 6, 3, 3, 2, 7, 3, 6, 5, 5, 3, 3, 6, 3, 5, 9, 3, 6, 6, 3, 1, 3, 5, 7, 6, 6, 12, 3, 10, 10, 7, 7, 3, 9, 3, 3, 12, 7, 3, 6, 5, 10, 9, 17, 7, 6, 5, 9, 3, 12, 6, 9, 2, 7, 3, 15, 5, 5, 14, 14, 9, 12, 12, 12, 3, 19, 6, 3, 17, 20

Offset: 0

Rémy Sigrist, Dec 23 2021

nonn

			For n = 21:
- A350226(21) = 3,
- the first 22 terms of A010060 are:
       0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1
                                        *              *              *
                            *                    *                    *
          *                             *                             *
- A010060(11) = A010060(16) = A010060(21),
- A010060(7) = A010060(14) = A010060(21),
- A010060(1) = A010060(11) = A010060(21),
- the first differences are 5, 7 and 10,
- the least first difference is 5,
- so a(21) = 5.

Rémy Sigrist, Table of n, a(n) for n = 0..8191
Rémy Sigrist, C program for A350285

Cf. A010060, A350226.

C
```
See Links section.
```

a(n) * (A350226(n) - 1) <= n.

cp's OEIS Frontend

A350235 a(n) is the least k such that A350226(k) = n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

C