A257702 -id:A257702 - cp's OEIS frontend

A257701 Number of steps from n to 1 using this algorithm: x -> floor(r*x) if x is odd, and x -> floor(x/r) if x is even, where r = sqrt(3).

0, 1, 5, 2, 4, 6, 8, 3, 16, 5, 9, 7, 9, 4, 15, 17, 21, 6, 8, 10, 12, 8, 18, 10, 14, 16, 18, 18, 20, 22, 32, 7, 11, 9, 11, 11, 13, 13, 17, 19, 23, 11, 13, 15, 19, 17, 21, 19, 21, 19, 21, 23, 31, 33, 37, 8, 10, 12, 14, 10, 22, 12, 16, 12, 14, 14, 16, 18, 22

Offset: 1

Clark Kimberling, May 04 2015

			7->12->6->3->5->8->4->2->1, total of 8 steps, so that a(7) = 8.

Clark Kimberling, Table of n, a(n) for n = 1..10000

Cf. A257698-A257700, A257702-A257706.

r = Sqrt[3]; f[x_] := If[OddQ[x], Floor[r *x], Floor[x/r]]
g[x_] := Drop[FixedPointList[f, x], -1];
Table[-1 + Length[g[n]], {n, 1, 200}]

A257703 Number of steps from n to 0 using this algorithm: x -> floor(e*x) if x is odd, and x -> floor(x/e) if x is even.

Original entry on oeis.org

2, 1, 3, 3, 11, 2, 8, 2, 4, 4, 8, 4, 10, 12, 14, 12, 14, 3, 7, 9, 13, 3, 5, 3, 7, 5, 9, 5, 7, 9, 11, 9, 17, 5, 9, 11, 13, 11, 13, 13, 19, 15, 17, 13, 15, 13, 25, 15, 23, 4, 6, 8, 10, 8, 14, 10, 12, 14, 16, 4, 8, 4, 8, 6, 8, 4, 6, 8, 12, 8, 10, 6, 8, 10, 20

Offset: 1

Clark Kimberling, May 04 2015

			5->13->35->95->258->94->34->12->4->1->2->0, total of 11 steps, so that a(5) = 11.

Clark Kimberling, Table of n, a(n) for n = 1..10000

Cf. A257698-A257702, A257704-A257706.

r = E; f[x_] := If[OddQ[x], Floor[r *x], Floor[x/r]]
g[x_] := Drop[FixedPointList[f, x], -1];
Table[-1 + Length[g[n]], {n, 1, 200}]

cp's OEIS Frontend

A257701 Number of steps from n to 1 using this algorithm: x -> floor(r*x) if x is odd, and x -> floor(x/r) if x is even, where r = sqrt(3).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica