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.

A269427 a(1) = 1, a(n) counts m < n for which n == a(m) (mod m).

Table of values

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

List of values

[1, 1, 2, 1, 4, 1, 3, 2, 4, 3, 3, 1, 7, 4, 2, 1, 7, 3, 4, 3, 4, 2, 6, 5, 7, 3, 2, 1, 10, 1, 6, 5, 6, 3, 3, 2, 8, 5, 6, 2, 5, 4, 6, 3, 6, 7, 6, 1, 10, 3, 3, 3, 9, 3, 5, 3, 7, 5, 8, 3, 7, 4, 6, 3, 5, 4, 7, 6, 7, 3, 4, 3, 9, 8, 7, 3, 6, 1, 6, 5, 6]

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

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