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.

A227946 Smallest m such that the number of iterations of "take odd part of phi" to reach 1 from m (A227944) is n.

Table of values

n a(n)
0 1
1 2
2 7
3 19
4 47
5 163
6 487
7 1307
8 2879
9 19683
10 39367
11 177147
12 531441
13 1594323
14 4782969
15 14348907
16 43046721
17 86093443
18 258280327
19 688747547
20 3486784401
21 10460353203

List of values

[1, 2, 7, 19, 47, 163, 487, 1307, 2879, 19683, 39367, 177147, 531441, 1594323, 4782969, 14348907, 43046721, 86093443, 258280327, 688747547, 3486784401, 10460353203]