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.

A152977 Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of partitions of 2^n into powers of 2 less than or equal to 2^k.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 1
6 1
7 2
8 3
9 1
10 1
11 2
12 4
13 5
14 1
15 1
16 2
17 4
18 9
19 9
20 1
21 1
22 2
23 4
24 10
25 25
26 17
27 1
28 1
29 2
30 4
31 10
32 35
33 81
34 33
35 1
36 1
37 2
38 4
39 10
40 36
41 165
42 289
43 65
44 1
45 1
46 2
47 4
48 10
49 36
50 201
51 969
52 1089
53 129
54 1
55 1
56 2
57 4
58 10
59 36
60 202
61 1625
62 6545
63 4225
64 257
65 1
66 1
67 2
68 4
69 10
70 36
71 202
72 1827
73 17361
74 47905
75 16641
76 513
77 1

List of values

[1, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 2, 4, 5, 1, 1, 2, 4, 9, 9, 1, 1, 2, 4, 10, 25, 17, 1, 1, 2, 4, 10, 35, 81, 33, 1, 1, 2, 4, 10, 36, 165, 289, 65, 1, 1, 2, 4, 10, 36, 201, 969, 1089, 129, 1, 1, 2, 4, 10, 36, 202, 1625, 6545, 4225, 257, 1, 1, 2, 4, 10, 36, 202, 1827, 17361, 47905, 16641, 513, 1]