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.

A242976 Number of ways to write n = i + j + k with 0 < i <= j <= k such that prime(i) mod i, prime(j) mod j and prime(k) mod k are all triangular numbers, where prime(m) mod m denotes the least nonnegative residue of prime(m) modulo m.

Table of values

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

List of values

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