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.

A258497 Number of words of length 2n such that all letters of the denary 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)
10 16796
11 2735810
12 255290156
13 17977098425
14 1063758951255
15 55927419074670
16 2700837720153300
17 122411464503168984
18 5284666028132079380
19 219622926821644989478
20 8855064908059488718600
21 348436223706779520860457
22 13441577595226619289460295
23 510180504585665885463323546

List of values

[16796, 2735810, 255290156, 17977098425, 1063758951255, 55927419074670, 2700837720153300, 122411464503168984, 5284666028132079380, 219622926821644989478, 8855064908059488718600, 348436223706779520860457, 13441577595226619289460295, 510180504585665885463323546]