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.

A348338 a(n) is the number of distinct numbers of steps required for the last n digits of integers to repeat themselves by iterating the map m -> 2*m.

Table of values

n a(n)
0 1
1 4
2 9
3 15
4 23
5 33
6 45
7 59
8 75
9 93
10 113
11 135
12 159
13 185
14 213
15 243
16 274
17 307
18 342
19 379
20 418
21 459
22 502
23 547
24 594
25 643
26 694
27 747
28 802
29 859
30 918
31 979
32 1042
33 1107
34 1174
35 1243
36 1314
37 1387
38 1462
39 1539
40 1618
41 1699
42 1782
43 1867
44 1954
45 2043
46 2134
47 2227
48 2322
49 2419
50 2518

List of values

[1, 4, 9, 15, 23, 33, 45, 59, 75, 93, 113, 135, 159, 185, 213, 243, 274, 307, 342, 379, 418, 459, 502, 547, 594, 643, 694, 747, 802, 859, 918, 979, 1042, 1107, 1174, 1243, 1314, 1387, 1462, 1539, 1618, 1699, 1782, 1867, 1954, 2043, 2134, 2227, 2322, 2419, 2518]