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.

A174088 Number of pairs (i,j) such that i*j == 0 (mod k), 0 <= i <= j < k.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 5
6 8
7 7
8 11
9 12
10 14
11 11
12 21
13 13
14 20
15 23
16 26
17 17
18 33
19 19
20 37
21 33
22 32
23 23
24 51
25 35
26 38
27 42
28 53
29 29
30 68
31 31
32 58
33 53
34 50
35 59
36 87
37 37
38 56
39 63
40 91
41 41
42 98
43 43
44 85
45 96
46 68
47 47
48 122
49 70
50 100
51 83
52 101
53 53
54 123
55 95
56 131
57 93
58 86
59 59
60 181
61 61
62 92
63 138
64 132
65 113
66 158
67 67
68 133
69 113

List of values

[1, 2, 3, 5, 5, 8, 7, 11, 12, 14, 11, 21, 13, 20, 23, 26, 17, 33, 19, 37, 33, 32, 23, 51, 35, 38, 42, 53, 29, 68, 31, 58, 53, 50, 59, 87, 37, 56, 63, 91, 41, 98, 43, 85, 96, 68, 47, 122, 70, 100, 83, 101, 53, 123, 95, 131, 93, 86, 59, 181, 61, 92, 138, 132, 113, 158, 67, 133, 113]

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

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