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.

A047909 Array read by antidiagonals upwards: h(n,k) = number of sequences with n copies each of 1,2,...,k and longest increasing subsequence of length k (n>=1, k>=1).

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 5
6 1
7 1
8 19
9 47
10 1
11 1
12 69
13 1306
14 641
15 1
16 1
17 251
18 31451
19 195709
20 11389
21 1
22 1
23 923
24 729811
25 46922017
26 50775091
27 248749
28 1
29 1
30 3431
31 16928840
32 10258694241
33 162588279629
34 20117051281
35 6439075
36 1
37 1
38 12869
39 397222288
40 2176464012941
41 449363984934526
42 1077273394836829
43 11260558754404
44 192621953
45 1

List of values

[1, 1, 1, 1, 5, 1, 1, 19, 47, 1, 1, 69, 1306, 641, 1, 1, 251, 31451, 195709, 11389, 1, 1, 923, 729811, 46922017, 50775091, 248749, 1, 1, 3431, 16928840, 10258694241, 162588279629, 20117051281, 6439075, 1, 1, 12869, 397222288, 2176464012941, 449363984934526, 1077273394836829, 11260558754404, 192621953, 1]