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.

A196736 Define k(x) = number of m such that A000005(gcd(n,m)) is x where m runs from 1 to n , x = 1,2,.. ; z = A000005( cototient(n) ) ; sequence gives numbers n such that n - ( Sum_{i=1..j} k(i) ) divides cototient(n) for any j <= z , k(i)>0.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 7
7 8
8 9
9 11
10 12
11 13
12 15
13 16
14 17
15 19
16 23
17 25
18 27
19 29
20 31
21 32
22 33
23 35
24 37
25 41
26 43
27 45
28 47
29 49
30 51
31 53
32 59
33 61
34 63
35 64
36 65
37 67
38 71
39 73
40 75
41 77
42 79
43 81
44 83
45 87
46 89
47 91
48 95
49 97
50 99
51 101
52 103
53 107
54 109
55 113
56 119
57 121
58 123
59 125
60 127

List of values

[1, 2, 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, 19, 23, 25, 27, 29, 31, 32, 33, 35, 37, 41, 43, 45, 47, 49, 51, 53, 59, 61, 63, 64, 65, 67, 71, 73, 75, 77, 79, 81, 83, 87, 89, 91, 95, 97, 99, 101, 103, 107, 109, 113, 119, 121, 123, 125, 127]