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.

A321040 Number of words of length 3n such that all letters of the denary 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)
10 1430715
11 385671000
12 59757446980
13 7005490433656
14 691555233881785
15 60757817462444531
16 4909804407096952946
17 372791285261732999200
18 26986460830582840320825
19 1882051044395835159556710
20 127426007577261157375345878
21 8424538202077517861490125956

List of values

[1430715, 385671000, 59757446980, 7005490433656, 691555233881785, 60757817462444531, 4909804407096952946, 372791285261732999200, 26986460830582840320825, 1882051044395835159556710, 127426007577261157375345878, 8424538202077517861490125956]