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.

A316290 a(n) is the number of ways of writing prime(n) as the sum of a prime number and a number that has only prime factors 2 and/or 5.

Table of values

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

List of values

[0, 1, 1, 3, 2, 3, 2, 3, 4, 2, 3, 3, 2, 4, 4, 4, 2, 5, 4, 4, 4, 4, 6, 2, 3, 3, 6, 5, 5, 5, 3, 4, 4, 6, 2, 5, 4, 4, 7, 5, 4, 6, 4, 3, 5, 6, 5, 3, 5, 6, 4, 5, 5, 3, 5, 6, 4, 6, 5, 5, 5, 6, 4, 5, 6, 6, 5, 4, 5, 5, 6, 4, 6, 4, 5, 6, 5, 5, 4, 5, 4, 5, 6, 6, 6, 6, 6]