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.

A381760 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 is not 0 and also does not exceed the last.

Table of values

n a(n)
1 1
2 1
3 1
4 3
5 11
6 38
7 130
8 638
9 4158
10 23384
11 124520
12 847484
13 6987380
14 53746000
15 400346544
16 3529108816
17 35963592624
18 351432650816
19 3346590201888
20 36341624453568

List of values

[1, 1, 1, 3, 11, 38, 130, 638, 4158, 23384, 124520, 847484, 6987380, 53746000, 400346544, 3529108816, 35963592624, 351432650816, 3346590201888, 36341624453568]