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.

A384147 Array A(n,k) = n*(A(n-1,k)+A(n-2,k)+...+A(n-k,k)), where A(n,k) = n if n <= k, read by antidiagonals with n >= 1 and k >= 1.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 2
6 3
7 1
8 8
9 3
10 4
11 1
12 20
13 3
14 4
15 5
16 1
17 56
18 27
19 4
20 5
21 6
22 1
23 152
24 99
25 4
26 5
27 6
28 7
29 1
30 416
31 387
32 64
33 5
34 6
35 7
36 8
37 1
38 1136
39 1539
40 304
41 5
42 6
43 7
44 8
45 9
46 1
47 3104
48 6075
49 1504
50 125
51 6
52 7
53 8
54 9
55 10
56 1
57 8480
58 24003
59 7504
60 725
61 6
62 7
63 8
64 9
65 10
66 11
67 1
68 23168
69 94851
70 37504
71 4325
72 216
73 7
74 8
75 9
76 10
77 11
78 12

List of values

[1, 1, 2, 1, 2, 3, 1, 8, 3, 4, 1, 20, 3, 4, 5, 1, 56, 27, 4, 5, 6, 1, 152, 99, 4, 5, 6, 7, 1, 416, 387, 64, 5, 6, 7, 8, 1, 1136, 1539, 304, 5, 6, 7, 8, 9, 1, 3104, 6075, 1504, 125, 6, 7, 8, 9, 10, 1, 8480, 24003, 7504, 725, 6, 7, 8, 9, 10, 11, 1, 23168, 94851, 37504, 4325, 216, 7, 8, 9, 10, 11, 12]