A138756 -id:A138756 - cp's OEIS frontend

A138753 Number of iterations of A138754 before reaching a number for the second time, when starting with n.

1, 4, 5, 3, 3, 5, 3, 8, 6, 4, 21, 17, 7, 7, 5, 5, 22, 24, 20, 18, 18, 16, 8, 6, 8, 6, 29, 23, 27, 23, 23, 21, 19, 19, 17, 21, 17, 15, 7, 7, 9, 60, 9, 9, 7, 30, 28, 26, 24, 26, 24, 24, 28, 24, 22, 20, 20, 22, 20, 18, 20, 18, 20, 18, 18, 16, 14, 12, 10, 12, 10, 61, 59, 55, 12, 10, 8, 31

Offset: 1

M. F. Hasler, Apr 01 2008

nonn

This is a variation of A138752, giving the number of iterations of A138754 needed to get any number for the second time, while A138752 stops counting somehow arbitrarily at 1=primepi(2) or 4=primepi(7).
The map A138754 is a variation of the Collatz map where parity of the integers is replaced by p mod 3 for the primes.
For the Collatz map, we have the only fixed point 0=f(0) and all other numbers seem to end up in the cycle 1->4->2->1.
Here the only fixed point is 1=A138754(1) and all other numbers seem to end up in the cycle 4 -> 7 -> 5 -> 4 (corresponding to primes 7 -> 17 -> 11 -> 7).
Depending on which number among primepi({2,7,11,17}) is reached first, A138753(n) = A138752(n)+1,+3,+2 resp. +1. (A138752(n) is the length of the so-called GB-sequence starting with prime(n).)

			a(1)=1 since after 1 step we find 1 again.
a(4)=3 since 4 -> 7 -> 5 -> 4 under A138754.

Paolo Xausa, Table of n, a(n) for n = 1..1459 (terms 1..500 from M. F. Hasler)
Georges Brougnard, Definition of GB-sequences.
Index entries for sequences related to 3x+1 (or Collatz) problem

Cf. A124123, A006577, A171938, A138756 (record values/indices).

Cf. A138750, A138751, A138752, A138754.

A138754[n_]:=A138754[n]=With[{p=Prime[n]},PrimePi[NextPrime[If[Mod[p,3]==2,p/2,2p]]]];
A138753[n_]:=Length[NestWhileList[A138754,n,UnsameQ,{1,4}]]-1;
Array[A138753,100] (* Paolo Xausa, Jul 28 2023*)

A138753(n,c=0,t=[1,1,1]) = { until( t[c++%3+1]==n=A138754(n), t[c%3+1]=n); c}

a(n) = min { k>0 | A138754^k(n) = A138754^m(n) for some m>=0, m

If n is not in {1,4,5,7}, then a(n) = 1+a(A138754(n)).

A171938 Record values in A138753 (a "prime" variation of the Collatz (3n+1) problem).

Original entry on oeis.org

1, 4, 5, 8, 21, 22, 24, 29, 60, 61, 72, 73, 97, 100, 184, 216, 239, 451, 469

Offset: 1

M. F. Hasler, Apr 01 2008

Cf. A124123, A138750-A138754, A138756, A006878 (analog for Collatz problem).

A138754[n_]:=A138754[n]=With[{p=Prime[n]},PrimePi[NextPrime[If[Mod[p,3]==2,p/2,2p]]]];
A138753[n_]:=Length[NestWhileList[A138754,n,UnsameQ,{1,4}]]-1;
A171938list[upto_]:=Module[{v,r=0},Table[If[(v=A138753[n])>r,r=v,Nothing],{n,upto}]];
A171938list[500] (* Paolo Xausa, Jul 29 2023 *)

m=0; for( i=1,#A138753, A138753[i] > m & print1( m=A138753[i],", "))

A171938(n) = A138753(A138756(n)).

A171938 = { A138753(m) | A138753(k) < A138753(m) for all k

Originally submitted as A138755, but mislaid by Editor-in-Chief; renumbered and added to OEIS, Oct 24 2010

a(15)-a(19) from Paolo Xausa, Jul 29 2023

A138757 a(n) = A007918(A138750(n)), that is, least prime > n/2 if n=2 (mod 3), > 2n otherwise.

Original entry on oeis.org

2, 2, 2, 7, 11, 3, 13, 17, 5, 19, 23, 7, 29, 29, 7, 31, 37, 11, 37, 41, 11, 43, 47, 13, 53, 53, 13, 59, 59, 17, 61, 67, 17, 67, 71, 19, 73, 79, 19, 79, 83, 23, 89, 89, 23, 97, 97, 29, 97, 101, 29, 103, 107, 29, 109, 113, 29, 127, 127, 31, 127, 127, 31, 127

Offset: 0

M. F. Hasler, Apr 04 2008

This can be considered as an analog of the Collatz (or 3n+1) map on the set of primes, see A138751 and A138754 for details.

Numbers 0,1,2 go immediately to the unique fixed point 2, all others end up in the cycle 7 -> 17 -> 11 -> 7, after a number of iterations given by A138753(A138757(n))-1 (= A138753(n)-2 if n is prime).

			a(7) = 17 since 7 = 1 (mod 3), thus A138750(7) = 2*7 = 14, nextprime(14) = 17.
a(11) = 7 since 11 = 2 (mod 3), thus A138750(11) = ceiling(11/2) = 6, nextprime(6) = 7.

Georges Brougnard, Definition of GB-sequences.
Index entries for sequences related to 3x+1 (or Collatz) problem

Cf. A124123, A138750, A138751, A138752, A138753, A138754, A138755, A138756, A007918.

np1[n_]:=Module[{x=Ceiling[n/2]},If[PrimeQ[x],x,NextPrime[x]]]; np2[n_]:= Module[{x=2n},If[PrimeQ[x],x,NextPrime[x]]]; Table[If[Mod[n,3]==2, np1[n], np2[n]],{n,0,70}] (* Harvey P. Dale, Jul 10 2013 *)

A138757(n)=nextprime(if(n%3==2,(n+1)\2,2*n))

a(n) = A007918(A138750(n)).

For p prime, a(p) = A138751(A000720(p))

Showing 1-3 of 3 results.

cp's OEIS Frontend

A138753 Number of iterations of A138754 before reaching a number for the second time, when starting with n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A171938 Record values in A138753 (a "prime" variation of the Collatz (3n+1) problem).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A138757 a(n) = A007918(A138750(n)), that is, least prime > n/2 if n=2 (mod 3), > 2n otherwise.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula