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.

A082974 a(n) = (a(n-1) + p(n)) mod p(n+1).

Table of values

n a(n)
1 2
2 0
3 5
4 1
5 12
6 8
7 6
8 2
9 25
10 23
11 17
12 13
13 11
14 7
15 1
16 54
17 52
18 46
19 42
20 40
21 34
22 30
23 24
24 16
25 12
26 10
27 6
28 4
29 0
30 113
31 109
32 103
33 101
34 91
35 89
36 83
37 77
38 73
39 67
40 61
41 59
42 49
43 47
44 43
45 41
46 29
47 17
48 13
49 11
50 7
51 1
52 240
53 230
54 224
55 218
56 212
57 210
58 204
59 200
60 198
61 188
62 174
63 170
64 168
65 164
66 150
67 144
68 134

List of values

[2, 0, 5, 1, 12, 8, 6, 2, 25, 23, 17, 13, 11, 7, 1, 54, 52, 46, 42, 40, 34, 30, 24, 16, 12, 10, 6, 4, 0, 113, 109, 103, 101, 91, 89, 83, 77, 73, 67, 61, 59, 49, 47, 43, 41, 29, 17, 13, 11, 7, 1, 240, 230, 224, 218, 212, 210, 204, 200, 198, 188, 174, 170, 168, 164, 150, 144, 134]

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

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