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.

A058048 For each prime P consider the generalized Collatz sequence of each integer N > 1 defined by c(0) = N, c(m+1) = c(m) * P + 1 if F > P, else c(m+1) = c(m) / F, where F is the smallest factor of c(m), until the sequence cycles. If all c(i) > 1 for some starting number N then P belongs to the sequence (and vice versa).

Table of values

n a(n)
1 2
2 11
3 13
4 17
5 19
6 23
7 31
8 37
9 43
10 47
11 53
12 59
13 61
14 67
15 71
16 73
17 83
18 97
19 101
20 103
21 113
22 131
23 137
24 139
25 151
26 163
27 167
28 173
29 181
30 193
31 197
32 223
33 227
34 229
35 233
36 239
37 241
38 251
39 257
40 263
41 269
42 271
43 277
44 281
45 283
46 293
47 313
48 331
49 347
50 353
51 367
52 373
53 379
54 383
55 389
56 401

List of values

[2, 11, 13, 17, 19, 23, 31, 37, 43, 47, 53, 59, 61, 67, 71, 73, 83, 97, 101, 103, 113, 131, 137, 139, 151, 163, 167, 173, 181, 193, 197, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 313, 331, 347, 353, 367, 373, 379, 383, 389, 401]

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

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