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.

A176866 The number of odd numbers that require n Collatz (3x+1) iterations to reach 1.

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 0
5 1
6 0
7 2
8 0
9 2
10 0
11 2
12 2
13 4
14 4
15 6
16 5
17 7
18 8
19 14
20 14
21 19
22 22
23 30
24 36
25 48
26 60
27 79
28 94
29 118
30 154
31 194
32 248
33 315
34 390
35 486
36 623
37 792
38 1008
39 1261
40 1579
41 2007
42 2555
43 3219
44 4043
45 5109
46 6464
47 8204
48 10351
49 13100
50 16575
51 20889
52 26398
53 33388
54 42155
55 53370
56 67414

List of values

[1, 0, 0, 0, 0, 1, 0, 2, 0, 2, 0, 2, 2, 4, 4, 6, 5, 7, 8, 14, 14, 19, 22, 30, 36, 48, 60, 79, 94, 118, 154, 194, 248, 315, 390, 486, 623, 792, 1008, 1261, 1579, 2007, 2555, 3219, 4043, 5109, 6464, 8204, 10351, 13100, 16575, 20889, 26398, 33388, 42155, 53370, 67414]

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

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