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.

A242635 Number of n-length words w over an n-ary alphabet {a_1,...,a_n} such that w contains never more than j consecutive letters a_j for 1<=j<=n.

Table of values

n a(n)
0 1
1 1
2 3
3 21
4 208
5 2631
6 40295
7 724892
8 14984945
9 350068993
10 9121438862
11 262285777567
12 8250643190038
13 281849526767134
14 10390959086757005
15 411219228179234026
16 17387847546353549435
17 782342249208357483984
18 37321230268969840324231
19 1881590248383756833279387

List of values

[1, 1, 3, 21, 208, 2631, 40295, 724892, 14984945, 350068993, 9121438862, 262285777567, 8250643190038, 281849526767134, 10390959086757005, 411219228179234026, 17387847546353549435, 782342249208357483984, 37321230268969840324231, 1881590248383756833279387]