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.

A171232 Array read by antidiagonals, T(n,k) = 2*(n/k) - 1, if n mod k = 0; otherwise, T(n,k) = 1.

Table of values

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

List of values

[1, 3, 1, 5, 1, 1, 7, 1, 1, 1, 9, 3, 1, 1, 1, 11, 1, 1, 1, 1, 1, 13, 5, 1, 1, 1, 1, 1, 15, 1, 3, 1, 1, 1, 1, 1, 17, 7, 1, 1, 1, 1, 1, 1, 1, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 21, 9, 5, 3, 1, 1, 1, 1, 1, 1, 1, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 25, 11, 1, 1, 1, 1]