|
|
A005184
|
|
Self-contained numbers: odd numbers k whose Collatz sequence contains a higher multiple of k.
(Formerly M5220)
|
|
3
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The Collatz sequence of a number k is defined as a(1)=k, a(j+1) = a(j)/2 if a(j) is even, 3*a(j) + 1 if a(j) is odd.
No others less than 250000000. - Sam Handler (sam_5_5_5_0(AT)yahoo.com), Aug 07 2006
There are no more terms < 10^15. - Alun Stokes, Mar 01 2021
|
|
REFERENCES
|
R. K. Guy, Unsolved Problems in Number Theory, E16.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
EXAMPLE
|
The Collatz sequence of 31 is 31, 94, 47, 142, 71, 214, 107, 322, 161, 484, 242, 121, 364, 182, 91, 274, 137, 412, 206, 103, 310 (see A008884) ... 310 is a multiple of 31, so the number 31 is "self-contained".
|
|
MATHEMATICA
|
isSelfContained[n_] := Module[{d}, d = n; While[d != 1, If[EvenQ[d], d = d/2, d = 3 * d + 1]; If[IntegerQ[d/n], Return[True]]]; Return[False]]; For[n = 1, n <= 250000000, n += 2, If[isSelfContained[n], Print[n]]]; (* Sam Handler (sam_5_5_5_0(AT)yahoo.com), Aug 07 2006 *)
scnQ[n_] := MemberQ[Divisible[#, n] & / @Rest[NestWhileList[If[EvenQ[#], #/2, 3# + 1] &, n, # > 1 &]], True]; Select[Range[1, 2100001, 2], scnQ] (* Harvey P. Dale, Oct 21 2011 *)
|
|
PROG
|
(PARI) m=5; d=2; while(1, n=(3*m+1)\2; until(n==1, n=if(n%2, 3*n+1, n\2); if(n%m==0, print(m, " ", n); break)); m+=d; d=6-d)
|
|
CROSSREFS
|
The ratios "higher multiple of k" / k are given in A059198.
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|