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.

A280849 Square array T(j,k) read by antidiagonals upwards, in which column k lists the numbers n having k odd divisors greater than sqrt(2*n), with j >= 1, k >= 0.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 21
7 6
8 7
9 27
10 75
11 8
12 9
13 33
14 135
15 105
16 12
17 10
18 39
19 147
20 189
21 315
22 16
23 11
24 45
25 165
26 225
27 525
28 495
29 20
30 13
31 51
32 171
33 297
34 675
35 585
36 945
37 24
38 14
39 55
40 175
41 351
42 693
43 765
44 1155
45 1575
46 28
47 15
48 57
49 195
50 385
51 735
52 855
53 1365
54 2475
55 2835
56 32
57 17
58 63
59 207
60 405
61 819
62 1071
63 1485
64 2625

List of values

[1, 2, 3, 4, 5, 21, 6, 7, 27, 75, 8, 9, 33, 135, 105, 12, 10, 39, 147, 189, 315, 16, 11, 45, 165, 225, 525, 495, 20, 13, 51, 171, 297, 675, 585, 945, 24, 14, 55, 175, 351, 693, 765, 1155, 1575, 28, 15, 57, 195, 385, 735, 855, 1365, 2475, 2835, 32, 17, 63, 207, 405, 819, 1071, 1485, 2625]