A276028 - cp's OEIS frontend

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

n	a(n)
1	1
2	3
3	10
4	50
5	259
6	1540
7	9594
8	62649
9	422598
10	2960716
11	21030711
12	152470357
13	1129502128
14	8434189996
15	63674017174
16	488573782216
17	3762932025753
18	29178861276815
19	229208503750838
20	1803350026315019
21	14248236439629534
22	113825380196996557
23	909507867095014380

[1, 3, 10, 50, 259, 1540, 9594, 62649, 422598, 2960716, 21030711, 152470357, 1129502128, 8434189996, 63674017174, 488573782216, 3762932025753, 29178861276815, 229208503750838, 1803350026315019, 14248236439629534, 113825380196996557, 909507867095014380]

cp's OEIS Frontend

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

Table of values

List of values