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.

A025157 Number of partitions of n with distinct parts p(i) such that if i != j, then |p(i) - p(j)| >= 3.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 2
6 2
7 3
8 3
9 4
10 4
11 5
12 6
13 7
14 8
15 10
16 11
17 13
18 15
19 17
20 19
21 22
22 25
23 28
24 32
25 36
26 41
27 46
28 52
29 58
30 66
31 73
32 82
33 91
34 102
35 113
36 126
37 139
38 155
39 171
40 190
41 209
42 232
43 255
44 282
45 310
46 342
47 375
48 413
49 452
50 497
51 544
52 596
53 651
54 713
55 778
56 850
57 927
58 1011
59 1101
60 1200
61 1305
62 1420
63 1544
64 1677
65 1821
66 1977
67 2144
68 2324
69 2519
70 2728

List of values

[1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 6, 7, 8, 10, 11, 13, 15, 17, 19, 22, 25, 28, 32, 36, 41, 46, 52, 58, 66, 73, 82, 91, 102, 113, 126, 139, 155, 171, 190, 209, 232, 255, 282, 310, 342, 375, 413, 452, 497, 544, 596, 651, 713, 778, 850, 927, 1011, 1101, 1200, 1305, 1420, 1544, 1677, 1821, 1977, 2144, 2324, 2519, 2728]