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.

A137791 Number of ways to write n as sum of two positive numbers having no prime gaps in their factorization.

Table of values

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

List of values

[0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 4, 5, 5, 6, 5, 6, 6, 7, 7, 8, 7, 7, 6, 8, 7, 8, 7, 8, 7, 9, 9, 10, 9, 10, 9, 11, 9, 11, 9, 10, 9, 11, 10, 10, 8, 10, 10, 13, 11, 12, 9, 11, 10, 14, 11, 12, 8, 10, 10, 14, 12, 13, 9, 12, 12, 14, 11, 12, 8, 11, 10, 16, 12, 11, 10, 14, 14, 16, 14, 14, 9, 13, 14, 18]