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.

A166278 Square array A(n,k), n,k>=0, read by antidiagonals: A(n,k) is the total element sum of the k-fold f transform applied to the length n sequence of 1's. And f returns a sorted result after multiplying the elements in its input sequence with 1, 2, 3,... in descending size order.

Table of values

n a(n)
0 0
1 0
2 1
3 0
4 1
5 2
6 0
7 1
8 3
9 3
10 0
11 1
12 4
13 6
14 4
15 0
16 1
17 6
18 10
19 10
20 5
21 0
22 1
23 8
24 19
25 20
26 15
27 6
28 0
29 1
30 12
31 33
32 46
33 35
34 21
35 7
36 0
37 1
38 16
39 63
40 100
41 94
42 56
43 28
44 8
45 0
46 1
47 24
48 111
49 220
50 242
51 172
52 84
53 36
54 9
55 0
56 1
57 32
58 201
59 488
60 633
61 514
62 290
63 120
64 45
65 10
66 0
67 1
68 48
69 369
70 1104
71 1643
72 1518
73 984
74 460
75 165
76 55
77 11

List of values

[0, 0, 1, 0, 1, 2, 0, 1, 3, 3, 0, 1, 4, 6, 4, 0, 1, 6, 10, 10, 5, 0, 1, 8, 19, 20, 15, 6, 0, 1, 12, 33, 46, 35, 21, 7, 0, 1, 16, 63, 100, 94, 56, 28, 8, 0, 1, 24, 111, 220, 242, 172, 84, 36, 9, 0, 1, 32, 201, 488, 633, 514, 290, 120, 45, 10, 0, 1, 48, 369, 1104, 1643, 1518, 984, 460, 165, 55, 11]