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.

A365203 a(1) = 1; a(n) = a(n - 1) + n if a(n - 1) < n, a(n) = n^2 if a(n - 1) = n, a(n) = a(n - 1)/n if a(n - 1) > n and a(n - 1) == 0 (mod n), otherwise a(n) = a(n - 1) - n.

Table of values

n a(n)
1 1
2 3
3 9
4 5
5 25
6 19
7 12
8 4
9 13
10 3
11 14
12 2
13 15
14 1
15 16
16 256
17 239
18 221
19 202
20 182
21 161
22 139
23 116
24 92
25 67
26 41
27 14
28 42
29 13
30 43
31 12
32 44
33 11
34 45
35 10
36 46
37 9
38 47
39 8
40 48
41 7
42 49
43 6
44 50
45 5
46 51
47 4
48 52
49 3
50 53
51 2
52 54
53 1
54 55
55 3025
56 2969
57 2912
58 2854
59 2795
60 2735
61 2674
62 2612
63 2549

List of values

[1, 3, 9, 5, 25, 19, 12, 4, 13, 3, 14, 2, 15, 1, 16, 256, 239, 221, 202, 182, 161, 139, 116, 92, 67, 41, 14, 42, 13, 43, 12, 44, 11, 45, 10, 46, 9, 47, 8, 48, 7, 49, 6, 50, 5, 51, 4, 52, 3, 53, 2, 54, 1, 55, 3025, 2969, 2912, 2854, 2795, 2735, 2674, 2612, 2549]