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.

A156709 For all numbers k(n) congruent to -1 or +1 (mod 6) starting with k(n) = {5,7,11,13,...}, a(k(n)) is incremented by the congruence (mod 6) if k(n) is prime and by 0 if k(n) is composite.

Table of values

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

List of values

[-1, 0, -1, 0, -1, 0, -1, -1, -2, -1, -1, 0, -1, 0, -1, -1, -2, -2, -3, -2, -2, -1, -2, -1, -1, 0, -1, -1, -2, -2, -2, -1, -2, -1, -2, -1, -2, -2, -2, -2, -2, -1, -2, -2, -3, -2, -2, -2, -3, -2, -2, -1, -1, 0, -1, -1, -2, -2, -3, -2, -2, -2, -3, -2, -3, -2, -2, -2, -2, -1, -1, -1, -1]