References
- [1] G. E. A
ndrews , The Theory of Partitions, Cambridge University Press, 1998. - [2] 1987 Austrian Olympiad, Crux Mathematicorum, 15 (1989) 264.
- [3] A. T. B
enjamin and J. J. Quinn , Proofs that Really Count: The Art of Combinatorial Proof, Mathematical Association of America, Washington, DC, 2003. - [4] V. B
ruyére , Automata and numeration systems, S´em. Lothar. Combin., 35 (1995) Art. B35b. - [5] R. D
e Castro , A. Ram ´ırez and J. L. Ram&ıacute;rez , Applications in enumerative combinatorics of infinite weighted automata and graphs, Sci. Ann. Comput. Sci., 24 (2014) 137–171. - [6] J. Y. C
hoi , A generalization of Collatz functions and Jacobsthal numbers, J. Integer Seq., 21 (2018) Art. 18.5.4. - [7] M. D
elest , Algebraic languages: a bridge between combinatorics and computer science, DI-MACS Ser. Discrete Math. Theoret. Comput. Sci., 24 (1996) 71–88. - [8] P. F
lajolet and R. Sedgewick , Analytic Combinatorics, Cambridge University Press, 2009. - [9] R. H
onsberger , From Erd˝os to Kiev: Problems of Olympiad Caliber, Mathematical Association of America, Washington, DC, 1996. - [10] T. K
oshy and R. P. Grimaldi , Ternary words and Jacobsthal numbers, Fibonacci Quart., 55 (2017) 129–136. - [11] H. P
rodinger , Ternary Smirnov words and generating functions, Integers, 18 (2018) #A69. - [12] J. S
akarovitch , Elements of Automata Theory, Cambridge University Press, 2009. - [13] M. A. S
hattuck and C. G. Wagner , Parity theorems for statistics on lattice paths and Laguerre configurations, J. Integer Seq., 8 (2005) Art. 5.5.1. - [14] M. A. S
hattuck and C. G. Wagner , A new statistic on linear and circular r-mino arrangements, Electron. J. Combin., 13 (2006) #R42. - [15] N. J. S
loane , On-Line Encyclopedia of Integer Sequences, available at http://oeis.org.