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.

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

Table of values

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

List of values

[1, 1, 2, 4, 8, 2, 0, 2, 9, 10, 18, 27, 4, 16, 11, 7, 2, 4, 13, 9, 0, 18, 4, 4, 2, 10, 3, 5, 26, 54, 21, 32, 4, 29, 42, 14, 10, 44, 57, 44, 63, 6, 5, 10, 52, 23, 32, 44, 64, 74, 71, 33, 18, 60, 93, 29, 46, 48, 60, 84, 38, 26, 39, 46, 83, 81, 25, 59, 93, 22, 47, 24, 34, 53]

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

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