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.

A235146 a(n) = Least integer k such that it takes n iterations of "factor and reverse bits of odd prime divisors" (A235027) before a fixed point or cycle of 2 is reached; records in A235145.

Table of values

n a(n)
0 0
1 19
2 139
3 719
4 4793
5 23773
6 260863
7 2375231
8 21793843

List of values

[0, 19, 139, 719, 4793, 23773, 260863, 2375231, 21793843]