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.

A351699 T(n,k) is the number of non-congruent maximal subsets of a grid of n X k lattice points (k <= n), such that no two points are at the same distance, and the points do not fit into a smaller grid. The size of the subsets is given by A351700. T(n,k) and A351700 are triangles read by rows.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 1
9 5
10 10
11 1
12 5
13 28
14 7
15 21
16 2
17 19
18 8
19 104
20 330
21 2
22 1
23 4
24 70
25 15
26 110
27 574
28 1
29 3
30 30
31 272
32 205
33 4
34 71
35 563
36 1991
37 4
38 68
39 50
40 1001
41 113
42 1130
43 4
44 76
45 383
46 9
47 8
48 362
49 35
50 1150
51 23
52 363
53 3975
54 7
55 38
56 8
57 18
58 1082
59 415
60 2
61 638
62 7503
63 23
64 515
65 5802
66 2
67 2
68 150
69 62
70 4238
71 120
72 1
73 55
74 1776
75 17277
76 26
77 481
78 2388

List of values

[1, 1, 1, 1, 2, 1, 1, 1, 5, 10, 1, 5, 28, 7, 21, 2, 19, 8, 104, 330, 2, 1, 4, 70, 15, 110, 574, 1, 3, 30, 272, 205, 4, 71, 563, 1991, 4, 68, 50, 1001, 113, 1130, 4, 76, 383, 9, 8, 362, 35, 1150, 23, 363, 3975, 7, 38, 8, 18, 1082, 415, 2, 638, 7503, 23, 515, 5802, 2, 2, 150, 62, 4238, 120, 1, 55, 1776, 17277, 26, 481, 2388]