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.

A178698 Largest k such that 2*composite(n)=composite(n-k)+composite(n+k).

Table of values

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

List of values

[0, 1, 0, 3, 4, 5, 4, 6, 7, 4, 0, 2, 7, 0, 5, 13, 15, 16, 13, 9, 11, 15, 20, 21, 18, 19, 25, 17, 0, 2, 21, 0, 19, 23, 25, 29, 23, 27, 28, 29, 39, 23, 14, 16, 38, 39, 40, 37, 38, 39, 32, 0, 1, 29, 30, 31, 28, 29, 30, 23, 24, 25, 26, 35, 22, 23, 38, 39, 40, 50, 57, 43, 44, 54, 32]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.