A276029 - cp's OEIS frontend

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

n	a(n)
1	1
2	4
3	27
4	228
5	2226
6	23778
7	270693
8	3229106
9	39922172
10	507680620
11	6604676830
12	87549425068
13	1178880306174
14	16086844260290
15	222045139578443
16	3095457073064120
17	43529719213465854
18	616853383573066504
19	8801227720060618544
20	126344910516550743232

[1, 4, 27, 228, 2226, 23778, 270693, 3229106, 39922172, 507680620, 6604676830, 87549425068, 1178880306174, 16086844260290, 222045139578443, 3095457073064120, 43529719213465854, 616853383573066504, 8801227720060618544, 126344910516550743232]

cp's OEIS Frontend

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

Table of values

List of values