OFFSET
0,3
COMMENTS
a(n) gives string listing winning position for n stones.
Sum of numbers in a(n) is equal to n.
Using the chromatic (tet-12) scale, (if C=0, 12, 24...) all integers correspond to pitches C, C#, G#, A, Bb, B, a recursive pattern that evenly bisects the octave and avoids the tritone (IC6). - Nik Bizzell-Browning, Apr 27 2019
LINKS
Nik Bizzell-Browning, Tchoukaillon solitaire sequence, Chromatic pitch table and example.
Nicholas John Bizzell-Browning, LIE scales: Composing with scales of linear intervallic expansion, Ph. D. Thesis, Brunel Univ. (UK, 2024). See p. 142.
D. M. Broline and Daniel E. Loeb, The combinatorics of Mancala-Type games: Ayo, Tchoukaillon and 1/Pi, J. Undergrad. Math. Applic., vol. 16 (1995), pp. 21-36.
FORMULA
To get the next term, if rightmost 0 is in position i, replace it by i and subtract 1 from all earlier entries.
EXAMPLE
For example, a(10) = 53111; rightmost 0 is in position 6, so get 653111 -> a(11) = 642000.
CROSSREFS
KEYWORD
nonn,nice,easy,base
AUTHOR
EXTENSIONS
More terms from Erich Friedman
STATUS
approved