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.

A215451 a(0)=1, a(n) = (sum of previous terms) mod (a(n-1)+n).

Table of values

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

List of values

[1, 1, 2, 4, 0, 3, 2, 4, 5, 8, 12, 19, 30, 5, 1, 1, 13, 21, 15, 11, 3, 17, 22, 20, 0, 20, 10, 28, 54, 0, 2, 4, 14, 23, 33, 0, 12, 28, 52, 45, 35, 48, 88, 61, 42, 36, 35, 70, 16, 1, 8, 41, 3, 21, 0, 5, 18, 23, 43, 17, 1, 41, 65, 111, 149, 25, 1, 53, 29, 63, 98, 102, 154, 5]

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

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