A239896 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

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

OFFSET

0,2

COMMENTS

See Section 9 in the linked paper.

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 12:3 (2022), 115-155.

FORMULA

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

CROSSREFS

Cf. A006064, A010060, A239110.

Sequence in context: A035683 A261009 A375347 * 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