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.

A321038 Number of words of length 3n such that all letters of the octonary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting triples of identical letters into the initially empty word.

Table of values

n a(n)
8 43263
9 7104240
10 694377450
11 52825297536
12 3463906615356
13 206132702914710
14 11470240358743842
15 608199451197152100
16 31120996552066805175
17 1550313320809537870320
18 75665062766954753664390
19 3635046065217379316477688
20 172499755061750807257325550

List of values

[43263, 7104240, 694377450, 52825297536, 3463906615356, 206132702914710, 11470240358743842, 608199451197152100, 31120996552066805175, 1550313320809537870320, 75665062766954753664390, 3635046065217379316477688, 172499755061750807257325550]