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.

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

Table of values

n a(n)
1 50
2 50
3 12
4 30
5 25
6 26
7 8
8 30
9 9
10 25
11 5
12 15
13 2
14 4
15 13
16 5
17 2
18 8
19 3
20 30
21 3
22 3
23 1
24 8
25 25
26 4
27 1
28 4
29 2
30 12
31 0
32 10
33 2
34 1
35 5
36 5
37 0
38 1
39 0
40 15
41 2
42 4
43 1
44 3
45 8
46 2
47 1
48 2
49 0
50 15
51 1
52 2
53 0
54 1
55 2
56 2
57 0
58 1
59 1
60 15
61 1
62 0
63 2
64 0
65 3
66 3
67 1
68 2
69 2
70 5
71 1
72 6
73 1
74 2
75 9
76 3
77 1
78 0
79 0
80 5
81 1
82 4

List of values

[50, 50, 12, 30, 25, 26, 8, 30, 9, 25, 5, 15, 2, 4, 13, 5, 2, 8, 3, 30, 3, 3, 1, 8, 25, 4, 1, 4, 2, 12, 0, 10, 2, 1, 5, 5, 0, 1, 0, 15, 2, 4, 1, 3, 8, 2, 1, 2, 0, 15, 1, 2, 0, 1, 2, 2, 0, 1, 1, 15, 1, 0, 2, 0, 3, 3, 1, 2, 2, 5, 1, 6, 1, 2, 9, 3, 1, 0, 0, 5, 1, 4]