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.

A336891 Sequence following Van Eck's sequence unless a prime which was previously encountered is found, in which case, a(n+1) = n - m, where m is the largest possible value such that a(m) is also prime.

Table of values

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

List of values

[0, 0, 1, 0, 2, 0, 2, 2, 1, 6, 0, 5, 0, 2, 2, 1, 7, 0, 5, 2, 1, 5, 2, 1, 3, 0, 8, 0, 2, 4, 0, 3, 3, 1, 10, 0, 5, 4, 8, 12, 0, 5, 5, 1, 10, 10, 1, 3, 5, 1, 3, 2, 1, 3, 2, 1, 3, 2, 1, 3, 2, 1, 3, 2, 1, 3, 2, 1, 3, 2, 1, 3, 2, 1, 3, 2, 1, 3, 2, 1, 3, 2, 1, 3, 2, 1]