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.

A284630 a(1)=1, a(2)=2; for n > 1, a(n+1) = (a(n-1) mod n) + n.

Table of values

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

List of values

[1, 2, 3, 5, 7, 5, 7, 12, 15, 12, 15, 12, 15, 25, 15, 25, 31, 25, 31, 25, 31, 25, 31, 25, 31, 25, 31, 52, 31, 52, 31, 52, 63, 52, 63, 52, 63, 52, 63, 52, 63, 52, 63, 52, 63, 52, 63, 52, 63, 52, 63, 52, 63, 105, 63, 105, 63, 105, 63, 105, 63, 105, 63, 105, 127, 105, 127, 105, 127, 105, 127, 105, 127, 105, 127, 105, 127, 105, 127, 105]

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

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