A318632 - cp's OEIS frontend

A318632 Let a partition of n be written in binary. Join any two binary ones which are adjacent horizontally or vertically. If all the binary ones are connected count this partition in a(n).

n	a(n)
1	1
2	2
3	2
4	4
5	3
6	5
7	5
8	9
9	8
10	11
11	12
12	17
13	16
14	21
15	24
16	34
17	34
18	43
19	47
20	61
21	65
22	82
23	92
24	116
25	124
26	147
27	166
28	200
29	220
30	262
31	293
32	350
33	383
34	449
35	504
36	592
37	654
38	756
39	846
40	983
41	1089
42	1252
43	1396
44	1607
45	1777
46	2033
47	2260
48	2590
49	2871
50	3261
51	3634
52	4116
53	4563
54	5145
55	5722
56	6454
57	7154
58	8032
59	8903
60	9989
61	11039

[1, 2, 2, 4, 3, 5, 5, 9, 8, 11, 12, 17, 16, 21, 24, 34, 34, 43, 47, 61, 65, 82, 92, 116, 124, 147, 166, 200, 220, 262, 293, 350, 383, 449, 504, 592, 654, 756, 846, 983, 1089, 1252, 1396, 1607, 1777, 2033, 2260, 2590, 2871, 3261, 3634, 4116, 4563, 5145, 5722, 6454, 7154, 8032, 8903, 9989, 11039]

cp's OEIS Frontend

A318632 Let a partition of n be written in binary. Join any two binary ones which are adjacent horizontally or vertically. If all the binary ones are connected count this partition in a(n).

Table of values

List of values