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.

A272181 a(1) = 1; a(n) = n mod a(k), k being the largest value such that n mod a(k) > 1, or n if there is no such k.

Table of values

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

List of values

[1, 2, 3, 2, 2, 6, 7, 2, 2, 3, 2, 5, 3, 2, 3, 2, 2, 3, 4, 2, 3, 2, 2, 4, 4, 2, 3, 3, 2, 2, 3, 2, 3, 2, 2, 36, 2, 2, 3, 4, 2, 2, 3, 2, 9, 2, 2, 3, 4, 2, 3, 7, 4, 2, 3, 2, 3, 2, 2, 4, 5, 2, 3, 4, 2, 2, 3, 2, 4, 2, 3, 2, 3, 2]