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.

A258494 Number of words of length 2n such that all letters of the septenary 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)
7 429
8 32032
9 1447992
10 51647700
11 1605746373
12 45730269662
13 1227377689395
14 31600247019120
15 789604855530855
16 19302666179660304
17 464277874912868104
18 11032638071392824348
19 259801742258903758053
20 6076538940891732415102
21 141407795779400734204647

List of values

[429, 32032, 1447992, 51647700, 1605746373, 45730269662, 1227377689395, 31600247019120, 789604855530855, 19302666179660304, 464277874912868104, 11032638071392824348, 259801742258903758053, 6076538940891732415102, 141407795779400734204647]