A258495 - cp's OEIS frontend

A258495 Number of words of length 2n 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 doublets into the initially empty word.

n	a(n)
8	1430
9	143208
10	8488440
11	389948856
12	15390120042
13	549818906780
14	18329867191350
15	581350326663600
16	17769492060922914
17	528200606751594392
18	15368894406877386408
19	439845149792754810984
20	12426477142114470011642
21	347532158068343623121916
22	9642227504194296532321086

[1430, 143208, 8488440, 389948856, 15390120042, 549818906780, 18329867191350, 581350326663600, 17769492060922914, 528200606751594392, 15368894406877386408, 439845149792754810984, 12426477142114470011642, 347532158068343623121916, 9642227504194296532321086]

cp's OEIS Frontend

A258495 Number of words of length 2n 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 doublets into the initially empty word.

Table of values

List of values