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.

A172528 Triangular array T(n,k) n,k>=0 is the number of k letter words formed using at most 1a,2b's,3c's,...,n#'s.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 3
6 3
7 1
8 3
9 8
10 19
11 38
12 60
13 60
14 1
15 4
16 15
17 53
18 175
19 535
20 1490
21 3675
22 7700
23 12600
24 12600
25 1
26 5
27 24
28 111
29 494
30 2111
31 8634
32 33635
33 123998
34 428820
35 1373820
36 4003230
37 10325700
38 22522500
39 37837800
40 37837800

List of values

[1, 1, 1, 1, 2, 3, 3, 1, 3, 8, 19, 38, 60, 60, 1, 4, 15, 53, 175, 535, 1490, 3675, 7700, 12600, 12600, 1, 5, 24, 111, 494, 2111, 8634, 33635, 123998, 428820, 1373820, 4003230, 10325700, 22522500, 37837800, 37837800]