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.

A381759 Number of words of length 2n+1 with one 0 entry and two entries of each of 1..n so that there are exactly k numbers between two equal k's and so that the first element does not exceed the last.

Table of values

n a(n)
1 1
2 1
3 3
4 5
5 11
6 38
7 182
8 938
9 4158
10 23384
11 160104
12 1063772
13 6987380
14 53746000
15 479965824
16 4182552416
17 35963592624
18 351432650816
19 3860219984448
20 41614300175968

List of values

[1, 1, 3, 5, 11, 38, 182, 938, 4158, 23384, 160104, 1063772, 6987380, 53746000, 479965824, 4182552416, 35963592624, 351432650816, 3860219984448, 41614300175968]