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.

A386883 Define a sequence of rationals by f(0) = 0, thereafter f(n) = f(n-1) - 1/n if that is >= 0, otherwise f(n) = f(n-1) + 1/n; a(n) corresponds to the number of addition steps minus the number of subtraction steps involved in calculating f(n).

Table of values

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

List of values

[0, 1, 0, -1, 0, -1, -2, -1, -2, -1, -2, -1, -2, -3, -2, -3, -2, -3, -2, -3, -2, -3, -2, -3, -2, -3, -2, -3, -2, -3, -2, -3, -2, -3, -4, -3, -4, -3, -4, -3, -4, -3, -4, -3, -4, -3, -4, -3, -4, -3, -4, -3, -4, -3, -4, -3, -4, -3, -4, -3, -4, -3, -4, -3, -4, -3]

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

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