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.

A370981 Triangle T(n, k), n >= 0, k = 0..n, read and filled in the greedy way by rows with distinct nonnegative integers, such that for any n > 0 and any k in 0..n, T(n, k) is congruent modulo n to T(n-1, k-1) (provided that k > 0) or to T(n-1, k) (provided that k < n).

Table of values

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

List of values

[0, 1, 2, 3, 4, 6, 9, 7, 10, 12, 5, 11, 14, 8, 16, 15, 20, 19, 13, 18, 21, 27, 26, 25, 31, 24, 30, 33, 34, 40, 32, 17, 38, 23, 37, 47, 42, 48, 56, 41, 22, 39, 29, 45, 55, 51, 57, 65, 50, 49, 58, 66, 36, 28, 46, 61, 67, 35, 60, 59, 68, 76, 86, 78, 88, 96]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.