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.

A258496 Number of words of length 2n such that all letters of the nonary 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)
9 4862
10 629850
11 47432550
12 2728352253
13 133216751525
14 5829093450180
15 236006398327050
16 9025008152896320
17 330547676678287002
18 11710509049983422030
19 404211829411082901714
20 13667296618312167097605
21 454559414725395785663741
22 14918526141220986683667840

List of values

[4862, 629850, 47432550, 2728352253, 133216751525, 5829093450180, 236006398327050, 9025008152896320, 330547676678287002, 11710509049983422030, 404211829411082901714, 13667296618312167097605, 454559414725395785663741, 14918526141220986683667840]