cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A242510 Number of n-length words on {1,2,3} such that the maximal blocks (runs) of 1's have odd length, the maximal blocks of 2's have even length and the maximal blocks of 3's have odd length.

Table of values

n a(n)
0 1
1 2
2 3
3 8
4 15
5 32
6 67
7 138
8 289
9 600
10 1249
11 2600
12 5409
13 11258
14 23427
15 48752
16 101455
17 211128
18 439363
19 914322
20 1902721
21 3959600
22 8240001
23 17147600
24 35684481
25 74260082
26 154536643
27 321593688
28 669242575
29 1392706512
30 2898248707

List of values

[1, 2, 3, 8, 15, 32, 67, 138, 289, 600, 1249, 2600, 5409, 11258, 23427, 48752, 101455, 211128, 439363, 914322, 1902721, 3959600, 8240001, 17147600, 35684481, 74260082, 154536643, 321593688, 669242575, 1392706512, 2898248707]