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.

A277647 Triangle T(n,k) = floor(n/sqrt(k)) for 1 <= k <= n^2, read by rows.

Table of values

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

List of values

[1, 2, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2]