Number of ways to transform a sequence of n ones to a single number by continually removing two numbers and replacing them with their sum modulo 3.

A276027

Number of ways to transform a sequence of n ones to a single number by continually removing two numbers and replacing them with their sum modulo 3.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =4a(5) =7a(6) =18a(7) =43a(8) =93a(9) =266a(10) =702a(11) =1687a(12) =5136a(13) =14405a(14) =36898a(15) =117016a(16) =341842a(17) =914064a(18) =2983027a(19) =8972121a(20) =24743851a(21) =82478973a(22) =253555061a(23) =715745648a(24) =2424954125a(25) =7582390623a(26) =21796481477a(27) =74805170349a(28) =237095926682a(29) =691568408221

External references