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.

A131971 a(0) = a(1) = a(2) = 1; a(n) = (a(n-1) + a(n-2) + a(n-3)) mod n.

Table of values

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

List of values

[1, 1, 1, 0, 2, 3, 5, 3, 3, 2, 8, 2, 0, 10, 12, 7, 13, 15, 17, 7, 19, 1, 5, 2, 8, 15, 25, 21, 5, 22, 18, 14, 22, 21, 23, 31, 3, 20, 16, 0, 36, 11, 5, 9, 25, 39, 27, 44, 14, 36, 44, 43, 19, 0, 8, 27, 35, 13, 17, 6, 36, 59, 39, 8, 42, 24, 8, 7, 39, 54, 30]

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

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