A357050 - cp's OEIS frontend

A357050 Number of ways A005101(n)+1 can be written as sum of a subset of the proper divisors of A005101(n), the n-th abundant number.

n	a(n)
1	2
2	1
3	1
4	4
5	4
6	7
7	2
8	2
9	10
10	2
11	2
12	32
13	2
14	1
15	26
16	1
17	6
18	24
19	1
20	19
21	20
22	2
23	1
24	1
25	20
26	4
27	1
28	270
29	11
30	14
31	1
32	14
33	116
34	12
35	9
36	12
37	3
38	195
39	1
40	2
41	719
42	1
43	42
44	1
45	8
46	9
47	8
48	2
49	148
50	142
51	6
52	1
53	8
54	6
55	6
56	2154
57	1
58	534
59	1
60	6
61	125
62	108
63	1
64	6
65	117
66	1
67	447
68	4

[2, 1, 1, 4, 4, 7, 2, 2, 10, 2, 2, 32, 2, 1, 26, 1, 6, 24, 1, 19, 20, 2, 1, 1, 20, 4, 1, 270, 11, 14, 1, 14, 116, 12, 9, 12, 3, 195, 1, 2, 719, 1, 42, 1, 8, 9, 8, 2, 148, 142, 6, 1, 8, 6, 6, 2154, 1, 534, 1, 6, 125, 108, 1, 6, 117, 1, 447, 4]

cp's OEIS Frontend

A357050 Number of ways A005101(n)+1 can be written as sum of a subset of the proper divisors of A005101(n), the n-th abundant number.

Table of values

List of values