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.

A127366 Let m = floor(sqrt(n)); if n and m have the same parity, a(n) = n + m, otherwise a(n) = n - m.

Table of values

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

List of values

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