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.

A341896 a(n) is the number of words of length n over the alphabet {a,b,c} with an even number of appearances of the letter 'a' and the sum of appearances of the letters 'b' and 'c' add up to at most 3.

Table of values

n a(n)
0 1
1 2
2 5
3 14
4 25
5 90
6 61
7 294
8 113
9 690
10 181
11 1342
12 265
13 2314
14 365
15 3670
16 481
17 5474
18 613
19 7790
20 761
21 10682
22 925
23 14214
24 1105
25 18450
26 1301
27 23454
28 1513
29 29290
30 1741
31 36022
32 1985
33 43714
34 2245
35 52430
36 2521
37 62234
38 2813
39 73190
40 3121
41 85362
42 3445
43 98814
44 3785
45 113610

List of values

[1, 2, 5, 14, 25, 90, 61, 294, 113, 690, 181, 1342, 265, 2314, 365, 3670, 481, 5474, 613, 7790, 761, 10682, 925, 14214, 1105, 18450, 1301, 23454, 1513, 29290, 1741, 36022, 1985, 43714, 2245, 52430, 2521, 62234, 2813, 73190, 3121, 85362, 3445, 98814, 3785, 113610]