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.

A278986 Array read by antidiagonals downwards: T(b,n) = number of words of length n over an alphabet of size b that are in standard order and which have the property that at least one letter is repeated.

Table of values

n a(n)
1 0
2 1
3 0
4 1
5 1
6 0
7 1
8 4
9 1
10 0
11 1
12 8
13 4
14 1
15 0
16 1
17 16
18 14
19 4
20 1
21 0
22 1
23 32
24 41
25 14
26 4
27 1
28 0
29 1
30 64
31 122
32 51
33 14
34 4
35 1
36 0
37 1
38 128
39 365
40 187
41 51
42 14
43 4
44 1
45 0
46 1
47 256
48 1094
49 715
50 202
51 51
52 14
53 4
54 1
55 0
56 1
57 512
58 3281
59 2795
60 855
61 202
62 51
63 14
64 4
65 1
66 0
67 1
68 1024
69 9842
70 11051
71 3845
72 876
73 202
74 51
75 14
76 4
77 1

List of values

[0, 1, 0, 1, 1, 0, 1, 4, 1, 0, 1, 8, 4, 1, 0, 1, 16, 14, 4, 1, 0, 1, 32, 41, 14, 4, 1, 0, 1, 64, 122, 51, 14, 4, 1, 0, 1, 128, 365, 187, 51, 14, 4, 1, 0, 1, 256, 1094, 715, 202, 51, 14, 4, 1, 0, 1, 512, 3281, 2795, 855, 202, 51, 14, 4, 1, 0, 1, 1024, 9842, 11051, 3845, 876, 202, 51, 14, 4, 1]