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.

A283593 Least m > 0 such that A283565(n) = Sum_{k=1..m} (A283565(n) mod k).

Table of values

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

List of values

[1, 2, 3, 5, 7, 6, 7, 7, 8, 9, 10, 8, 12, 11, 13, 15, 14, 15, 16, 20, 17, 20, 22, 25, 25, 25, 24, 24, 29, 28, 29, 31, 38, 36, 38, 38, 43, 41, 41, 46, 45, 47, 45, 48, 47, 47, 45, 47, 48, 48, 46, 49, 53, 51, 57, 58, 65, 55, 58, 65, 59, 57, 63, 60, 60, 63, 67, 68]

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

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