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.

A236453 Number of length n strings on the alphabet {0,1,2} of the form 0^i 1^j 2^k such that i,j,k>=0 and if i=1 then j=k.

Table of values

n a(n)
0 1
1 3
2 4
3 8
4 11
5 17
6 22
7 30
8 37
9 47
10 56
11 68
12 79
13 93
14 106
15 122
16 137
17 155
18 172
19 192
20 211
21 233
22 254
23 278
24 301
25 327
26 352
27 380
28 407
29 437
30 466
31 498
32 529
33 563
34 596
35 632
36 667
37 705
38 742
39 782
40 821
41 863
42 904
43 948
44 991
45 1037
46 1082
47 1130
48 1177
49 1227
50 1276
51 1328
52 1379
53 1433
54 1486
55 1542

List of values

[1, 3, 4, 8, 11, 17, 22, 30, 37, 47, 56, 68, 79, 93, 106, 122, 137, 155, 172, 192, 211, 233, 254, 278, 301, 327, 352, 380, 407, 437, 466, 498, 529, 563, 596, 632, 667, 705, 742, 782, 821, 863, 904, 948, 991, 1037, 1082, 1130, 1177, 1227, 1276, 1328, 1379, 1433, 1486, 1542]