[seqfan] Formulas for two sequences, A060574 and A067498 ?
antti.karttunen at gmail.com
Mon Mar 28 11:55:53 CEST 2022
Does anybody know formulas for these two sequences?
Tower of Hanoi: using the optimal way to move an even number of disks
from peg 0 to peg 2 or an odd number from peg 0 to peg 1, a(n) is the
smallest disk on peg 1 after n moves (or 0 if there are no disks on
Maximum number of reflections for a ray of light which reflects at n
points (reflecting more than once at most or all points).
These recently appeared among the newly mined LODA-programs (see
https://github.com/loda-lang/ ), but at least for the latter there are
so few terms present that it is highly likely a case of strong law of
More information about the SeqFan