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.

A125677 a(0) = a(1) = 1; for n>1, a(n) = a(n-2) + a(n-1) (mod n).

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 5
5 3
6 8
7 4
8 12
9 7
10 19
11 15
12 22
13 24
14 32
15 26
16 42
17 34
18 58
19 35
20 73
21 45
22 74
23 50
24 76
25 51
26 101
27 71
28 116
29 71
30 127
31 74
32 137
33 79
34 148
35 87
36 163
37 102
38 189
39 135
40 204
41 175
42 211
43 214
44 249
45 238
46 257
47 260
48 277
49 292
50 319
51 305
52 364
53 351
54 391
55 357
56 412
57 370
58 434
59 391
60 465
61 429

List of values

[1, 1, 2, 3, 5, 3, 8, 4, 12, 7, 19, 15, 22, 24, 32, 26, 42, 34, 58, 35, 73, 45, 74, 50, 76, 51, 101, 71, 116, 71, 127, 74, 137, 79, 148, 87, 163, 102, 189, 135, 204, 175, 211, 214, 249, 238, 257, 260, 277, 292, 319, 305, 364, 351, 391, 357, 412, 370, 434, 391, 465, 429]

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

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