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.

A095720 a(1)=1 and, for n>1, a(n)=a(n-1)+Floor(3n/4) if n is even, else a(n)=smallest positive integer which has not yet appeared in the sequence.

Table of values

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

List of values

[1, 3, 2, 5, 4, 8, 6, 12, 7, 15, 9, 18, 10, 20, 11, 23, 13, 27, 14, 29, 16, 32, 17, 35, 19, 39, 21, 42, 22, 44, 24, 48, 25, 51, 26, 53, 28, 56, 30, 60, 31, 63, 33, 66, 34, 68, 36, 72, 37, 75, 38, 77, 40, 80, 41, 83, 43, 87, 45, 90, 46, 92, 47, 95, 49, 99, 50, 101, 52, 104, 54]