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.

A241663 Number of positive integers k less than or equal to n such that gcd(k,n) = gcd(k+1,n) = gcd(k+2,n) = gcd(k+3,n) = 1.

Table of values

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

List of values

[1, 0, 0, 0, 1, 0, 3, 0, 0, 0, 7, 0, 9, 0, 0, 0, 13, 0, 15, 0, 0, 0, 19, 0, 5, 0, 0, 0, 25, 0, 27, 0, 0, 0, 3, 0, 33, 0, 0, 0, 37, 0, 39, 0, 0, 0, 43, 0, 21, 0, 0, 0, 49, 0, 7, 0, 0, 0, 55, 0, 57, 0, 0, 0, 9, 0, 63, 0, 0, 0, 67, 0, 69, 0, 0, 0, 21, 0, 75, 0, 0]

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

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