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.

A082538 Number of numbers k which give 1 after applying exactly n iterations of the 3k+1 algorithm (if a number is even, divide it by 2; if it is odd, multiply by 3 and add 1). This total includes numbers k which also give 1 for a smaller number of iterations (i.e., for this sequence we do not assume the algorithm halts when 1 is reached).

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 2
5 3
6 4
7 6
8 7
9 10
10 12
11 15
12 20
13 26
14 33
15 44
16 55
17 69
18 88
19 113
20 141
21 179
22 226
23 284
24 358
25 453
26 571
27 724
28 913
29 1149
30 1456
31 1839
32 2323
33 2945
34 3718
35 4688
36 5933
37 7498
38 9476
39 11982
40 15126
41 19111
42 24172
43 30535
44 38563
45 48733
46 61560
47 77792
48 98313
49 124240

List of values

[1, 1, 1, 2, 2, 3, 4, 6, 7, 10, 12, 15, 20, 26, 33, 44, 55, 69, 88, 113, 141, 179, 226, 284, 358, 453, 571, 724, 913, 1149, 1456, 1839, 2323, 2945, 3718, 4688, 5933, 7498, 9476, 11982, 15126, 19111, 24172, 30535, 38563, 48733, 61560, 77792, 98313, 124240]