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.

A258499 Number of words of length 4n such that all letters of the n-ary 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)
0 1
1 1
2 34
3 3509
4 657370
5 182587701
6 67773956250
7 31600247019120
8 17769492060922914
9 11710509049983422030
10 8855064908059488718600
11 7558849413204728468703991
12 7190781941414575290014093320
13 7544364858457252265315311530675
14 8654711454787575656983217747533920

List of values

[1, 1, 34, 3509, 657370, 182587701, 67773956250, 31600247019120, 17769492060922914, 11710509049983422030, 8855064908059488718600, 7558849413204728468703991, 7190781941414575290014093320, 7544364858457252265315311530675, 8654711454787575656983217747533920]