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.

A258492 Number of words of length 2n such that all letters of the quinary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting doublets into the initially empty word.

Table of values

n a(n)
5 42
6 1485
7 34034
8 647920
9 11187462
10 182587701
11 2880017910
12 44477796451
13 677940669900
14 10250875770135
15 154278143783022
16 2316262521915440
17 34742240691197182
18 521131993897607925
19 7822497290908844702
20 117554364707534272375
21 1769075045150700563052

List of values

[42, 1485, 34034, 647920, 11187462, 182587701, 2880017910, 44477796451, 677940669900, 10250875770135, 154278143783022, 2316262521915440, 34742240691197182, 521131993897607925, 7822497290908844702, 117554364707534272375, 1769075045150700563052]