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.

A261774 Number of compositions of n where the (possibly scattered) maximal subsequence of part i with multiplicity j is marked with a word of length i*j over an n-ary alphabet whose letters appear in alphabetical order and all n letters occur exactly once in the composition.

Table of values

n a(n)
0 1
1 1
2 2
3 8
4 29
5 117
6 696
7 4286
8 25458
9 156843
10 1156246
11 9521096
12 79140828
13 665427791
14 5610420458
15 49509430318
16 475540600965
17 4831978977077
18 51175720976994
19 552595605354707
20 5923618798039611
21 63654533191518745
22 705094561770919436
23 8127236135685948103

List of values

[1, 1, 2, 8, 29, 117, 696, 4286, 25458, 156843, 1156246, 9521096, 79140828, 665427791, 5610420458, 49509430318, 475540600965, 4831978977077, 51175720976994, 552595605354707, 5923618798039611, 63654533191518745, 705094561770919436, 8127236135685948103]