A239896 Generalized ternary Thue-Morse sequence arising from junction numbers problem in base 10.

0, 2, 2, 4, 4, 4, 4, 6, 6, 6, 6, 6, 6, 6, 6, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 8, 3, 8, 3, 8, 3, 8, 3, 8, 3, 8, 3, 8, 3, 8, 3, 8, 3, 8, 3, 8, 3, 8, 3, 8, 3, 8, 3, 8, 3, 8, 3, 8, 3, 8, 3, 8, 3

Offset

0,2

Comments

Details will be added soon.

Links

Table of n, a(n) for n=0..99.

Max A. Alekseyev and N. J. A. Sloane, On Kaprekar's Junction Numbers, arXiv:2112.14365, 2021; Journal of Combinatorics and Number Theory, 2022 (to appear).

Formula

a(n) = (A006064(n) mod 9).

Crossrefs

Cf. A006064, A010060, A239110.

Sequence in context: A165040 A035683 A261009 * A001670 A100144 A076222

Adjacent sequences: A239893 A239894 A239895 * A239897 A239898 A239899

Keyword

nonn

Author

Max Alekseyev and N. J. A. Sloane, Apr 05 2014

Status

approved