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.

A340260 T(n, k) = Sum_{j=1..k} [n mod j <> 1], where [] is the Iverson bracket. Table read by rows.

Table of values

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

List of values

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