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.

A372696 For n>1, if n mod a(n-1) = 0 or a(n-1) mod n = 0, set a(n) = n + a(n-1); otherwise a(n) = abs(n - a(n-1)). Start with a(1)=1.

Table of values

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

List of values

[1, 3, 6, 2, 3, 9, 2, 10, 1, 11, 22, 10, 3, 11, 4, 20, 3, 21, 2, 22, 1, 23, 46, 22, 3, 23, 4, 32, 3, 33, 2, 34, 1, 35, 70, 34, 3, 35, 4, 44, 3, 45, 2, 46, 1, 47, 94, 46, 3, 47, 4, 56, 3, 57, 2, 58, 1, 59, 118, 58, 3, 59, 4, 68, 3, 69, 2, 70, 1, 71, 142, 70, 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.