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.

A349553 a(n) is the least k such that n is the number of halving partitions of k (=A349552(k)).

Table of values

n a(n)
1 0
2 3
3 5
4 15
5 11
6 19
7 21
8 27
9 37
10 69
11 45
12 43
13 191
14 99
15 75
16 83
17 87
18 85
19 153
20 107
21 157
22 151
23 149
24 155
25 183
26 179
27 205
28 173
29 219
30 171
31 213
32 335
33 315
34 307
35 395
36 301
37 309
38 333
39 299
40 331
41 339
42 365
43 343
44 469
45 347
46 341
47 429
48 589
49 627
50 587
51 427
52 595
53 659
54 669
55 795
56 599
57 915
58 597
59 603
60 661
61 679
62 619
63 667
64 723
65 691
66 813
67 731
68 877
69 1181
70 693
71 685
72 811
73 1253

List of values

[0, 3, 5, 15, 11, 19, 21, 27, 37, 69, 45, 43, 191, 99, 75, 83, 87, 85, 153, 107, 157, 151, 149, 155, 183, 179, 205, 173, 219, 171, 213, 335, 315, 307, 395, 301, 309, 333, 299, 331, 339, 365, 343, 469, 347, 341, 429, 589, 627, 587, 427, 595, 659, 669, 795, 599, 915, 597, 603, 661, 679, 619, 667, 723, 691, 813, 731, 877, 1181, 693, 685, 811, 1253]