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.

A363447 a(0) = 0; a(n) = a(a(n-1))-1 mod (n+1) for all n >= 1.

Table of values

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

List of values

[0, 1, 0, 3, 2, 5, 4, 1, 0, 9, 8, 11, 10, 7, 0, 15, 14, 17, 16, 13, 6, 3, 2, 23, 22, 1, 0, 27, 26, 29, 28, 25, 0, 33, 32, 35, 34, 31, 24, 21, 2, 41, 40, 1, 0, 45, 44, 47, 46, 43, 0, 51, 50, 53, 52, 49, 42, 39, 20, 5, 4, 1, 0, 63, 62, 65, 64, 61, 0, 69, 68, 71]

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

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