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.

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

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 5
5 4
6 9
7 7
8 8
9 15
10 12
11 6
12 10
13 21
14 19
15 14
16 22
17 23
18 9
19 20
20 16
21 38
22 44
23 52
24 21
25 40
26 57
27 24
28 22
29 65
30 48
31 26
32 79
33 78
34 18
35 17
36 32
37 102
38 136
39 41
40 23
41 53
42 58
43 26
44 76
45 83
46 150
47 47
48 56
49 54
50 14
51 22
52 63
53 56
54 17
55 24
56 44
57 97
58 117
59 253
60 118
61 112
62 58
63 171
64 143
65 74

List of values

[1, 1, 2, 3, 5, 4, 9, 7, 8, 15, 12, 6, 10, 21, 19, 14, 22, 23, 9, 20, 16, 38, 44, 52, 21, 40, 57, 24, 22, 65, 48, 26, 79, 78, 18, 17, 32, 102, 136, 41, 23, 53, 58, 26, 76, 83, 150, 47, 56, 54, 14, 22, 63, 56, 17, 24, 44, 97, 117, 253, 118, 112, 58, 171, 143, 74]

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

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