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.

A253387 A "mod sequence" where a(n) is the eventual constant value attained by the sequence defined as b(1) = n, b(m) = (sum_{k=1..m-1} b(k)) mod m, with a(n) = -1 in case a constant run is not found.

Table of values

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

List of values

[97, 97, 1, 1, 2, 2, 2, 2, 316, 316, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 12, 12, 4, 4, 4, 4, 12, 12, 11, 11, 11, 11, 316, 316, 11, 11, 316, 316, 316, 316, 6, 6, 316, 316, 316, 316, 316, 316, 316, 316, 97, 97, 316, 316, 316, 316, 13, 13, 316, 316, 13]

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

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