A293975 -id:A293975 - cp's OEIS frontend

A293982 Length (= size) of the orbit of n under iterations of A293975: x -> x/2 if even, x + nextprime(x) if odd; or -1 if the orbit is infinite.

1, 5, 5, 5, 5, 8, 6, 13, 5, 11, 9, 9, 7, 10, 14, 8, 6, 14, 12, 14, 10, 12, 10, 13, 8, 19, 11, 17, 15, 11, 9, 17, 7, 17, 15, 15, 13, 15, 15, 13, 11, 15, 13, 18, 11, 16, 14, 22, 9, 16, 20, 14, 12, 18, 18, 16, 16, 14, 12, 12, 10, 10, 18, 22, 8, 20, 18, 20, 16, 18, 16, 16, 14

Offset: 0

M. F. Hasler, Nov 05 2017

nonn

The orbit of x under f is O(x; f) = { f^k(x); k = 0, 1, 2,... }.

It is conjectured that for f = A293975, the trajectory (f^k(x); k >= 0) ends in the cycle 1 -> 3 -> 8 -> 4 -> 2 -> 1 for any starting value x.

			a(0) = 1 = # { 0 }, since 0 -> 0 -> 0 ... under A293975.
a(1) = 5 = # { 1, 3, 8, 4, 2 }, since 1 -> (1 + 2 =) 3 -> (3 + 5 =) 8 -> 4 -> 2 -> 1 -> 3 etc... under A293975.
a(2) = 5 = # { 2, 1, 3, 8, 4 }, since 2 -> 1 -> 3 -> 8 -> 4 -> 2 -> 1 etc... under A293975.
a(5) = 8 = # { 5, 12, 6, 3, 8, 4, 2, 1 }, since 5 -> (5 + 7 =) 12 -> 6 -> 3 -> (3 + 5 =) 8 -> 4 -> 2 -> 1 -> 3 etc... under A293975.

Harvey P. Dale, Table of n, a(n) for n = 0..1000

Cf. A293975, A174221 (the "PrimeLatz" map), A006370 (the "3x+1" map).

Table[Flatten[FindTransientRepeat[NestList[If[EvenQ[#],#/2,#+ NextPrime[ #]]&,n,100],3]]//Length,{n,0,80}] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Jun 13 2018 *)

A293982(n,S=[n])={while(#S<#S=setunion(S,[n=A293975(n)]),);#S}

A294659 Largest number in the orbit of n under iteration of the map A293975: x -> x/2 if even, x + nextprime(x) else.

Original entry on oeis.org

0, 8, 8, 8, 12, 8, 20, 8, 20, 12, 24, 12, 32, 20, 32, 16, 36, 20, 44, 20, 44, 24, 52, 24, 56, 32, 56, 28, 60, 32, 68, 32, 72, 36, 72, 36, 80, 44, 80, 40, 84, 44, 92, 44, 92, 52, 100, 48, 104, 56, 104, 52, 112, 56, 116, 56, 116, 60, 120, 60, 128, 68, 132, 64, 132, 72, 140, 68, 140, 72, 144, 72, 152, 80

Offset: 0

M. F. Hasler, Nov 06 2017

nonn

The trajectory under iterations of A293975 seems to end in the cycle 1 -> 3 -> 8 -> 4 -> 2 -> 1, for any positive starting value n. Therefore a(n) >= 8 for all n > 0.
Obviously also a(n) >= n for all numbers, with equality for powers of two 2^k with k >= 3; a(n) >= n + nextprime(n) >= 2n+2 for all odd numbers.
Record values not of the form f(n) = n + nextprime(n) occur for a(1) = 8, a(5) = 12, a(7) = 20, a(11) = 24, a(13) = 32, a(17) = 36, a(19) = 44, a(23) = 52, a(25) = 56, a(29) = 60, a(31) = 68, a(33) = 72, a(37) = 80, a(41) = 84, a(43) = 92, a(47) = 100, ... We see that in most cases, this equals f(f(n)/2). Exceptions are n = 1, 7, 13, 19, 37, 43, 67, 79, 89, 97, ...

Cf. A293975, A293982 (size of the orbit).

A294659(n,S=[n])={while(#S<#S=setunion(S,[n=A293975(n)]),); vecmax(S)}

A294643 Length (= size) of the orbit of n under the "3x+1" map A006370: x -> x/2 if even, 3x+1 if odd. a(n) = -1 in case the orbit would be infinite.

Original entry on oeis.org

1, 3, 3, 8, 3, 6, 9, 17, 4, 20, 7, 15, 10, 10, 18, 18, 5, 13, 21, 21, 8, 8, 16, 16, 11, 24, 11, 112, 19, 19, 19, 107, 6, 27, 14, 14, 22, 22, 22, 35, 9, 110, 9, 30, 17, 17, 17, 105, 12, 25, 25, 25, 12, 12, 113, 113, 20, 33, 20, 33, 20, 20, 108, 108, 7, 28, 28

Offset: 0

M. F. Hasler, Nov 05 2017

nonn

The orbit of x under f is O(x; f) = { f^k(x); k = 0, 1, 2, ... }, i.e., the set of all points in the trajectory of x under iterations of f.

The famous "3x+1 problem" or Collatz conjecture (also attributed to other names) states that for f = A006370, the trajectory (f^k(x); k >= 0) always ends in the cycle 1 -> 4 -> 2 -> 1, for any integer starting value x >= 0.

			a(0) = 1 = # { 0 }, since 0 -> 0 -> 0 ... under A006370.
a(1) = 3 = # { 1, 4, 2 }, since 1 -> (3*1 + 1 =) 4 -> 2 -> 1 -> 4 etc. under A006370.
a(3) = 8 = # { 3, 10, 5, 16, 8, 4, 2, 1 }, since 3 -> 10 -> 5 -> 16 -> 8 -> 4 -> 2 -> 1 -> 4 etc. under A006370.

Cf. A006370 (Collatz or 3x+1 map), A008908 (number of steps to reach 1), A174221 (the "PrimeLatz" map: add 3 next primes), A293980, A293975 (variant: add the next prime), A293982.

cp's OEIS Frontend

A293982 Length (= size) of the orbit of n under iterations of A293975: x -> x/2 if even, x + nextprime(x) if odd; or -1 if the orbit is infinite.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A294659 Largest number in the orbit of n under iteration of the map A293975: x -> x/2 if even, x + nextprime(x) else.

Views

Author

Keywords

Comments

Crossrefs

Programs

PARI

A294643 Length (= size) of the orbit of n under the "3x+1" map A006370: x -> x/2 if even, 3x+1 if odd. a(n) = -1 in case the orbit would be infinite.

Views

Author

Keywords

Comments

Examples

Crossrefs