A382508 - cp's OEIS frontend

A382508 a(n) is the number of solutions to the problem described in A381621 with smallest price equal to n.

n	a(n)
1	4728
2	2314
3	1165
4	2169
5	1429
6	703
7	304
8	1006
9	283
10	1532
11	129
12	351
13	135
14	241
15	595
16	668
17	58
18	175
19	72
20	511
21	60
22	136
23	52
24	166
25	994
26	51
27	36
28	110
29	35
30	331
31	15
32	123
33	12
34	49
35	109
36	69
37	20
38	39
39	12
40	301
41	18
42	36
43	20
44	37
45	57
46	31
47	19
48	74
49	6
50	315
51	11
52	29
53	8
54	10
55	38
56	24
57	10
58	25
59	6
60	95

[4728, 2314, 1165, 2169, 1429, 703, 304, 1006, 283, 1532, 129, 351, 135, 241, 595, 668, 58, 175, 72, 511, 60, 136, 52, 166, 994, 51, 36, 110, 35, 331, 15, 123, 12, 49, 109, 69, 20, 39, 12, 301, 18, 36, 20, 37, 57, 31, 19, 74, 6, 315, 11, 29, 8, 10, 38, 24, 10, 25, 6, 95]

cp's OEIS Frontend

A382508 a(n) is the number of solutions to the problem described in A381621 with smallest price equal to n.

Table of values

List of values