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.

A321125 T(n,k) = b(n+k) - (2*b(n)*b(k) + 1)*b(n*k) + b(n) + b(k) + 1, where b(n) = A154272(n+1), square array read by antidiagonals (n >= 0, k >= 0).

Table of values

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

List of values

[1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1]