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.

A239030 T(n,k)=Number of nXk 0..2 arrays with no element equal to the sum of elements to its left or one plus the sum of the elements above it, modulo 3.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 3
6 2
7 1
8 4
9 4
10 4
11 1
12 5
13 7
14 11
15 4
16 1
17 6
18 11
19 28
20 16
21 8
22 1
23 7
24 16
25 59
26 54
27 43
28 8
29 1
30 8
31 22
32 110
33 149
34 212
35 64
36 16
37 1
38 9
39 29
40 189
41 354
42 806
43 428
44 171
45 16
46 1
47 10
48 37
49 306
50 757
51 2592
52 2195
53 1652
54 256
55 32
56 1
57 11
58 46
59 473
60 1495
61 7265
62 9319
63 11768
64 3410
65 683
66 32
67 1
68 12
69 56

List of values

[1, 1, 2, 1, 3, 2, 1, 4, 4, 4, 1, 5, 7, 11, 4, 1, 6, 11, 28, 16, 8, 1, 7, 16, 59, 54, 43, 8, 1, 8, 22, 110, 149, 212, 64, 16, 1, 9, 29, 189, 354, 806, 428, 171, 16, 1, 10, 37, 306, 757, 2592, 2195, 1652, 256, 32, 1, 11, 46, 473, 1495, 7265, 9319, 11768, 3410, 683, 32, 1, 12, 56]