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.

A258493 Number of words of length 2n such that all letters of the senary 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)
6 132
7 7007
8 231868
9 6191808
10 146698848
11 3229298919
12 67773956250
13 1377513928505
14 27389291758920
15 536341475466069
16 10391807506431956
17 199869644353809760
18 3824918464184384952
19 72954292150964887751
20 1388571904028052188458
21 26397789023379585277557

List of values

[132, 7007, 231868, 6191808, 146698848, 3229298919, 67773956250, 1377513928505, 27389291758920, 536341475466069, 10391807506431956, 199869644353809760, 3824918464184384952, 72954292150964887751, 1388571904028052188458, 26397789023379585277557]