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.

A153112 a(0) = 0 and a(1)=a(2)=1; a(n) = a(a(n-1)) + a(n-a(n-1)) unless floor( sum_{i=0..n-1} a(i)/2) mod 16*A069705(n) = 1 in which case a(n) = A010882(n).

Table of values

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

List of values

[0, 1, 1, 1, 2, 2, 3, 3, 3, 4, 5, 5, 5, 5, 6, 7, 7, 8, 8, 8, 8, 8, 9, 10, 11, 2, 12, 12, 12, 13, 13, 2, 14, 14, 14, 14, 15, 16, 16, 17, 18, 18, 19, 19, 10, 19, 20, 20, 20, 21, 21, 21, 10, 24, 24, 13, 24, 25, 16, 26, 26, 26, 27, 27, 28, 28, 1, 2, 2, 3, 3, 3, 4, 5, 5, 5, 2, 6, 7, 7, 8, 8, 8, 8, 5]