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.

A213878 Number of words w where each letter of the 8-ary alphabet occurs n times and for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.

Table of values

n a(n)
0 1
1 40320
2 2027025
3 13681123135
4 551211090935595
5 64157120593526429971
6 15388200323143520006870562
7 6273648300104128965616586081511
8 3847028733161627562733350467148495403
9 3264601141014490309682718148875987514642243

List of values

[1, 40320, 2027025, 13681123135, 551211090935595, 64157120593526429971, 15388200323143520006870562, 6273648300104128965616586081511, 3847028733161627562733350467148495403, 3264601141014490309682718148875987514642243]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.