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.

A213295 Number of n-length words w over 7-ary alphabet such that 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 7
2 49
3 280
4 1414
5 6104
6 23527
7 83916
8 296268
9 1050777
10 3771418
11 13717679
12 50861266
13 191950441
14 739460834
15 2901202157
16 11612278801
17 47307362988
18 196385040929
19 828929230122
20 3560359729835
21 15531007871015
22 68843517673532
23 309567264833019
24 1412620935530761

List of values

[1, 7, 49, 280, 1414, 6104, 23527, 83916, 296268, 1050777, 3771418, 13717679, 50861266, 191950441, 739460834, 2901202157, 11612278801, 47307362988, 196385040929, 828929230122, 3560359729835, 15531007871015, 68843517673532, 309567264833019, 1412620935530761]