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.

A261718 Number A(n,k) of partitions of n where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 1
5 0
6 1
7 2
8 2
9 0
10 1
11 3
12 7
13 3
14 0
15 1
16 4
17 15
18 18
19 5
20 0
21 1
22 5
23 26
24 55
25 50
26 7
27 0
28 1
29 6
30 40
31 124
32 216
33 118
34 11
35 0
36 1
37 7
38 57
39 235
40 631
41 729
42 301
43 15
44 0
45 1
46 8
47 77
48 398
49 1470
50 2780
51 2621
52 684
53 22
54 0
55 1
56 9
57 100
58 623
59 2955
60 8001
61 12954
62 8535
63 1621
64 30
65 0

List of values

[1, 1, 0, 1, 1, 0, 1, 2, 2, 0, 1, 3, 7, 3, 0, 1, 4, 15, 18, 5, 0, 1, 5, 26, 55, 50, 7, 0, 1, 6, 40, 124, 216, 118, 11, 0, 1, 7, 57, 235, 631, 729, 301, 15, 0, 1, 8, 77, 398, 1470, 2780, 2621, 684, 22, 0, 1, 9, 100, 623, 2955, 8001, 12954, 8535, 1621, 30, 0]