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.

A341654 Table read by antidiagonals upward: |T(n,k)| is the smallest number j such that j and j+1 have n and k divisors, respectively, or 0 if no such number exists, and the sign of T(n,k) is positive iff there exists only one such number j.

Table of values

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

List of values

[0, 0, 1, 0, 2, 0, 0, 4, 3, 0, 0, -6, 0, -5, 0, 0, 16, 8, -9, 0, 0, 0, -12, 0, -14, 0, -11, 0, 0, 0, 0, -81, 15, -49, 0, 0, 0, -30, 0, -20, 0, -27, 0, -23, 0, 0, -36, 24, 64, 0, 0, 0, -169, 0, 0, 0, -112, 0, -54, 0, -44, 0, -39, 0, -47, 0, 0, 0, 48, -225, 0, 0, 63, -130321, 35, 57121, 0, 0]