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.

A235451 Number of length n words on alphabet {0,1,2} of the form 0^(i)1^(j)2^(k) such that i=j or j=k.

Table of values

n a(n)
0 1
1 2
2 4
3 3
4 6
5 6
6 7
7 8
8 10
9 9
10 12
11 12
12 13
13 14
14 16
15 15
16 18
17 18
18 19
19 20
20 22
21 21
22 24
23 24
24 25
25 26
26 28
27 27
28 30
29 30
30 31
31 32
32 34
33 33
34 36
35 36
36 37
37 38
38 40
39 39
40 42
41 42
42 43
43 44
44 46
45 45
46 48
47 48
48 49
49 50
50 52
51 51
52 54
53 54
54 55
55 56
56 58
57 57
58 60
59 60
60 61

List of values

[1, 2, 4, 3, 6, 6, 7, 8, 10, 9, 12, 12, 13, 14, 16, 15, 18, 18, 19, 20, 22, 21, 24, 24, 25, 26, 28, 27, 30, 30, 31, 32, 34, 33, 36, 36, 37, 38, 40, 39, 42, 42, 43, 44, 46, 45, 48, 48, 49, 50, 52, 51, 54, 54, 55, 56, 58, 57, 60, 60, 61]