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.

A118874 A halting sequence: let f_n be the n-th recursive function, relative to the Godel numbering given in Cutland, then a(n) is f_n(n)+1 if the corresponding program halts on input n, 0 otherwise.

Table of values

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

List of values

[1, 3, 1, 4, 2, 1, 1, 0, 1, 12, 2, 1, 1, 1, 1, 16, 0, 19, 1, 21, 3, 2, 2, 0, 1, 1, 1, 1, 1, 1, 1, 32, 1, 0, 0, 36, 2, 1, 1, 0, 2, 45, 3, 2, 2, 2, 2, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 64, 1, 67, 1, 0, 0, 0, 0, 0, 1, 76, 2, 1, 1, 1, 1, 81, 0, 84, 2, 86, 4, 3, 3, 0, 2, 2, 2, 2, 2, 2, 2, 1, 1, 0, 0]