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.

A329983 For any n > 0, define the sequence b(1) = n, b(i+1) = (b(i) * i) mod (b(i) + i); a(n) is the least i such that b(i) = 0, or -1 if 0 is never reached.

Table of values

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

List of values

[1, 13, 3, 85, 13, 85, 7, 58, 4, 13, 7, 85, 5, 7, 13, 58, 58, 85, 85, 13, 5, 85, 7, 291, 13, 85, 58, 85, 58, 7, 85, 291, 85, 85, 13, 58, 13, 58, 291, 11, 6, 58, 13, 7, 13, 85, 7, 291, 58, 85, 9, 85, 7, 13, 13, 58, 85, 13, 9, 58, 291, 291, 13, 11]

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

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