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.

A342337 Number of integer partitions of n with all adjacent parts (x, y) satisfying either x = y or x = 2y.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 4
5 4
6 7
7 6
8 9
9 10
10 12
11 11
12 19
13 14
14 20
15 24
16 27
17 24
18 37
19 31
20 44
21 45
22 49
23 48
24 71
25 61
26 72
27 80
28 92
29 84
30 118
31 102
32 128
33 132
34 144
35 151
36 191
37 166
38 197
39 211
40 244
41 226
42 287
43 263
44 313
45 330
46 348
47 347
48 435
49 399
50 462
51 476
52 524
53 508
54 614
55 591
56 674
57 680
58 732
59 731
60 890
61 814
62 916
63 966
64 1042
65 1032
66 1188
67 1135
68 1280
69 1303

List of values

[1, 1, 2, 3, 4, 4, 7, 6, 9, 10, 12, 11, 19, 14, 20, 24, 27, 24, 37, 31, 44, 45, 49, 48, 71, 61, 72, 80, 92, 84, 118, 102, 128, 132, 144, 151, 191, 166, 197, 211, 244, 226, 287, 263, 313, 330, 348, 347, 435, 399, 462, 476, 524, 508, 614, 591, 674, 680, 732, 731, 890, 814, 916, 966, 1042, 1032, 1188, 1135, 1280, 1303]