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.

A381802 a(n) = number of distinct residues r mod n of numbers k congruent to r (mod n) such that rad(k) does not divide n, where rad = A007947.

Table of values

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

List of values

[0, 0, 1, 1, 3, 1, 5, 4, 6, 3, 9, 4, 11, 8, 7, 11, 15, 6, 17, 11, 12, 9, 21, 13, 22, 11, 23, 19, 27, 11, 29, 26, 24, 23, 23, 20, 35, 17, 33, 28, 39, 18, 41, 28, 30, 32, 45, 32, 46, 22, 31, 35, 51, 23, 47, 44, 36, 27, 57, 32, 59, 54, 50, 57, 55, 34, 65, 55, 54, 35]

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

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