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.

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

Table of values

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

List of values

[2, 4, 1, 6, 2, 1, 8, 1, 1, 1, 10, 4, 2, 1, 1, 12, 1, 1, 1, 1, 1, 14, 6, 1, 2, 1, 1, 1, 16, 1, 4, 1, 1, 1, 1, 1, 18, 8, 1, 1, 2, 1, 1, 1, 1, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 22, 10, 6, 4, 1, 2, 1, 1, 1, 1, 1, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 26, 12, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 28, 1, 8, 1, 4, 1, 1, 1]