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.

A089177 Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= 1+log_2(floor(n))) giving number of non-squashing partitions of n into k parts.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 1
6 1
7 3
8 2
9 1
10 4
11 4
12 1
13 1
14 5
15 6
16 2
17 1
18 6
19 9
20 4
21 1
22 7
23 12
24 6
25 1
26 8
27 16
28 10
29 1
30 1
31 9
32 20
33 14
34 2
35 1
36 10
37 25
38 20
39 4
40 1
41 11
42 30
43 26
44 6
45 1
46 12
47 36
48 35
49 10
50 1
51 13
52 42
53 44
54 14
55 1
56 14
57 49
58 56
59 20
60 1
61 15
62 56
63 68
64 26
65 1
66 16
67 64
68 84
69 36
70 1
71 1
72 17
73 72
74 100
75 46
76 2
77 1
78 18
79 81
80 120
81 60
82 4
83 1

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 2, 1, 4, 4, 1, 1, 5, 6, 2, 1, 6, 9, 4, 1, 7, 12, 6, 1, 8, 16, 10, 1, 1, 9, 20, 14, 2, 1, 10, 25, 20, 4, 1, 11, 30, 26, 6, 1, 12, 36, 35, 10, 1, 13, 42, 44, 14, 1, 14, 49, 56, 20, 1, 15, 56, 68, 26, 1, 16, 64, 84, 36, 1, 1, 17, 72, 100, 46, 2, 1, 18, 81, 120, 60, 4, 1]