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.

A348712 Square array read by falling antidiagonals: T(n,k) is the number of bounded regions formed by the Lissajous curve x=cos(n*t), y=sin(k*t).

Table of values

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

List of values

[1, 2, 0, 3, 1, 3, 4, 1, 8, 0, 5, 2, 1, 0, 5, 6, 2, 18, 3, 14, 0, 7, 3, 23, 1, 23, 3, 7, 8, 3, 2, 6, 32, 0, 20, 0, 9, 4, 33, 1, 1, 8, 33, 0, 9, 10, 4, 38, 9, 50, 10, 46, 7, 26, 0, 11, 5, 3, 2, 59, 1, 59, 0, 3, 5, 11, 12, 5, 48, 12, 68, 15, 72, 14, 60, 9, 32, 0]