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.

A005186 a(n) is the number of integers m which take n steps to reach 1 in '3x+1' problem.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 2
6 2
7 4
8 4
9 6
10 6
11 8
12 10
13 14
14 18
15 24
16 29
17 36
18 44
19 58
20 72
21 91
22 113
23 143
24 179
25 227
26 287
27 366
28 460
29 578
30 732
31 926
32 1174
33 1489
34 1879
35 2365
36 2988
37 3780
38 4788
39 6049
40 7628
41 9635
42 12190
43 15409
44 19452
45 24561
46 31025
47 39229
48 49580
49 62680
50 79255
51 100144

List of values

[1, 1, 1, 1, 1, 2, 2, 4, 4, 6, 6, 8, 10, 14, 18, 24, 29, 36, 44, 58, 72, 91, 113, 143, 179, 227, 287, 366, 460, 578, 732, 926, 1174, 1489, 1879, 2365, 2988, 3780, 4788, 6049, 7628, 9635, 12190, 15409, 19452, 24561, 31025, 39229, 49580, 62680, 79255, 100144]

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

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