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.

A291213 Start from the singleton set S = {n}, and unless 1 is already a member of S, generate on each iteration a new set where each odd number k is replaced by 3k+1, and each even number k is replaced by 3k+1 and k/2. a(n) is the total size of the set from the singleton through after the first iteration which has produced 1 as a member, inclusive.

Table of values

n a(n)
1 1
2 3
3 36
4 6
5 20
6 72
7 1168
8 11
9 216
10 35
11 576
12 143
13 111
14 2422
15 1657
16 19
17 336
18 378
19 6253
20 66
21 51
22 1167
23 820
24 241
25 24096
26 180
27 18805
28 215
29 3833
30 3488
31 368905
32 31
33 3460
34 575
35 426
36 716
37 576
38 12387
39 57556
40 110
41 10513
42 83
43 8948
44 2303
45 1782
46 1656
47 175195
48 387
49 1647

List of values

[1, 3, 36, 6, 20, 72, 1168, 11, 216, 35, 576, 143, 111, 2422, 1657, 19, 336, 378, 6253, 66, 51, 1167, 820, 241, 24096, 180, 18805, 215, 3833, 3488, 368905, 31, 3460, 575, 426, 716, 576, 12387, 57556, 110, 10513, 83, 8948, 2303, 1782, 1656, 175195, 387, 1647]

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

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