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.

A359220 Number of steps to reach 0 from A359219(n) where A359219 are the starting numbers that require more iterations in the map x->A359194(x) than any smaller number.

Table of values

n a(n)
1 0
2 1
3 2
4 11
5 12
6 13
7 19
8 80
9 81
10 83
11 7572
12 7573
13 7574
14 7578
15 7580
16 664475
17 664882
18 3180929
19 3180930
20 3180931
21 3181981
22 3181988
23 3182002
24 3182226
25 120796790
26 556068798
27 556068799
28 556068871
29 556068872
30 572086553
31 572086610
32 1246707529
33 1246707552
34 1246707555
35 1246707602

List of values

[0, 1, 2, 11, 12, 13, 19, 80, 81, 83, 7572, 7573, 7574, 7578, 7580, 664475, 664882, 3180929, 3180930, 3180931, 3181981, 3181988, 3182002, 3182226, 120796790, 556068798, 556068799, 556068871, 556068872, 572086553, 572086610, 1246707529, 1246707552, 1246707555, 1246707602]

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

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