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.

A085496 Number of ways to write prime(n) as sum of distinct divisors of prime(n)+1.

Table of values

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

List of values

[0, 1, 1, 1, 2, 0, 1, 1, 5, 3, 1, 0, 2, 0, 10, 1, 31, 0, 0, 26, 0, 6, 23, 20, 0, 0, 1, 13, 0, 0, 1, 15, 0, 14, 9, 0, 0, 0, 190, 0, 713, 0, 42, 0, 7, 9, 0, 9, 6, 0, 6, 2148, 0, 509, 0, 120, 109, 1, 0, 0, 0, 4, 6, 100, 0, 0, 0, 0, 2, 4, 0, 21897, 1, 0, 3, 85, 79, 0, 0, 0, 19172, 0, 1130]