A075102 -id:A075102 - cp's OEIS frontend

A073524 Number of steps to reach an integer starting with (n+1)/n and using the map x -> x*ceiling(x); or -1 if no integer is ever reached.

0, 1, 2, 3, 18, 2, 3, 4, 6, 7, 26, 4, 9, 3, 4, 8, 6, 4, 56, 11, 3, 4, 42, 4, 33, 7, 5, 4, 38, 5, 79, 6, 4, 15, 14, 8, 200, 29, 13, 5, 36, 3, 4, 5, 7, 10, 11, 8, 6, 20, 47, 27, 43, 9, 41, 9, 10, 23, 37, 17, 18, 6, 7, 6, 32, 15, 225, 7, 73, 11, 20, 12, 182, 9, 16, 7, 10, 15, 196, 8

Offset: 1

N. J. A. Sloane, Aug 29 2002

Computed by doing all computations over the integers (multiply by n) and by truncating modulo n^250. This avoids the explosion of the integers (of order 2^(2^k) after k iterations) and gives the correct answer if the final index i(n) is < 250 (or perhaps 249 or 248). If the algorithm does not stop before 245 one should increase precision (work with n^500 or even higher). - Roland Bacher
Always reaches an integer for n <= 100. - Roland Bacher, Aug 30 2002
Always reaches an integer for n <= 200. - N. J. A. Sloane, Sep 04 2002
Always reaches an integer for n <= 500 by comparing results with index 1000 and index 2500. - Robert G. Wilson v, Sep 11 2002
Always reaches an integer for n <= 3000. The Mathematica program automatically adjusts the modulus m required to find the first integral iterate. - T. D. Noe, Apr 10 2006
Always reaches an integer for n <= 5000. - Ben Branman, Feb 12 2011

			a(7) = 3 since 8/7 -> 16/7 -> 48/7 -> 48.

T. D. Noe, Table of n, a(n) for n=1..3000
J. C. Lagarias and N. J. A. Sloane, Approximate squaring (pdf, ps), Experimental Math., 13 (2004), 113-128.

Cf. A073528, A073529, A068119, A001511, A072340, A075102, A073341.

Table[{n, First[Flatten[Position[Map[Denominator, NestList[ # Ceiling[ # ] &, (n + 1)/n, 20]], 1]]]}, {n, 1, 20}]
f[n_] := Block[{k = (n + 1)/n, c = 0}, While[ !IntegerQ[k], c++; k = Mod[k*Ceiling[k], n^250]]; c]; Table[ f[n], {n, 1, 100}]
Table[lim=50; While[k=0; x=1+1/n; m=n^lim; While[kT. D. Noe, Apr 10 2006 *)

a(5)-a(10), a(12)-a(18), a(20) = 11 from Ed Pegg Jr, Aug 29 2002
T. D. Noe also found a(5) and remarks that the final integer is 9.5329600...*10^57734. - Aug 29 2002
a(11) from T. D. Noe, who remarks that the final integer is 5.131986636061311...*10^13941166 - Aug 29 2002
a(19) and a(21) onwards from Roland Bacher, Aug 30 2002

A075107 Number of steps to reach the first integer (= A075108(n)) starting with n/floor(log_2(n)) and iterating the map x -> x*ceiling(x), or -1 if no integer is ever reached.

Original entry on oeis.org

0, 0, 0, 2, 0, 1, 1, 0, 5, 2, 0, 3, 2, 0, 0, 3, 3, 2, 0, 2, 1, 3, 0, 2, 2, 2, 0, 1, 1, 1, 2, 5, 3, 0, 16, 2, 4, 6, 0, 4, 16, 9, 2, 0, 1, 1, 1, 1, 0, 4, 2, 4, 8, 0, 2, 5, 2, 8, 0, 9, 3, 4, 5, 2, 0, 1, 1, 1, 1, 1, 0, 5, 7, 3, 2, 4, 0, 9, 4, 1, 2, 3, 0, 4, 1, 2, 1

Offset: 2

Reinhard Zumkeller, Sep 02 2002

nonn

Starting values given by A075105(n)/A075106(n).

			a(5)=2 since 5/floor(log_2(5)) = 5/2 -> 15/2 -> 60 = A075108(5).

Cf. A068119, A073524, A075102, A075120.

More terms from Jinyuan Wang, Jan 15 2022

A075120 Number of steps to reach the first integer (= A075121(n)) starting with n/floor(sqrt(n)) and iterating the map x -> x*ceiling(x), or -1 if no integer is ever reached.

Original entry on oeis.org

0, 0, 0, 0, 2, 0, 1, 0, 0, 5, 2, 0, 3, 2, 0, 0, 3, 3, 2, 0, 2, 1, 3, 0, 0, 8, 3, 5, 2, 0, 3, 2, 5, 3, 0, 0, 6, 2, 2, 4, 2, 0, 5, 3, 1, 4, 2, 0, 0, 7, 12, 5, 11, 12, 2, 0, 4, 3, 9, 12, 6, 16, 0, 0, 3, 7, 8, 4, 4, 4, 2, 0, 2, 4, 5, 1, 5, 2, 5, 0, 0, 7, 3, 22, 3, 3

Offset: 1

Reinhard Zumkeller, Sep 03 2002

nonn

Starting with A073890(n)/A075119(n).

			a(13)=3 since 13/floor(sqrt(13)) = 13/3 -> 65/3 -> 1430/3 -> 227370 = A075121(13).

Cf. A068119, A073524, A075102, A075107, A075121.

More terms from Jinyuan Wang, Jan 15 2022

cp's OEIS Frontend

A075103 Integer reached in A075102.

Views

Author

Keywords

A073524 Number of steps to reach an integer starting with (n+1)/n and using the map x -> x*ceiling(x); or -1 if no integer is ever reached.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A075107 Number of steps to reach the first integer (= A075108(n)) starting with n/floor(log_2(n)) and iterating the map x -> x*ceiling(x), or -1 if no integer is ever reached.

Views

Author

Keywords

Comments

Examples

Crossrefs

Extensions

A075120 Number of steps to reach the first integer (= A075121(n)) starting with n/floor(sqrt(n)) and iterating the map x -> x*ceiling(x), or -1 if no integer is ever reached.

Views

Author

Keywords

Comments

Examples

Crossrefs

Extensions