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.

A118096 Number of partitions of n such that the largest part is twice the smallest part.

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 2
6 3
7 3
8 4
9 6
10 6
11 6
12 10
13 9
14 11
15 13
16 14
17 15
18 20
19 18
20 23
21 25
22 27
23 27
24 37
25 35
26 39
27 43
28 48
29 49
30 61
31 57
32 68
33 72
34 78
35 81
36 97
37 95
38 107
39 114
40 127
41 128
42 150
43 148
44 168
45 179
46 191
47 198
48 229
49 230
50 254
51 266
52 291
53 300
54 338
55 344
56 379
57 398
58 427
59 444
60 498
61 505
62 550
63 580
64 625

List of values

[0, 0, 1, 1, 2, 3, 3, 4, 6, 6, 6, 10, 9, 11, 13, 14, 15, 20, 18, 23, 25, 27, 27, 37, 35, 39, 43, 48, 49, 61, 57, 68, 72, 78, 81, 97, 95, 107, 114, 127, 128, 150, 148, 168, 179, 191, 198, 229, 230, 254, 266, 291, 300, 338, 344, 379, 398, 427, 444, 498, 505, 550, 580, 625]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.