login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275531 Values taken by the sum of numbers in Collatz trajectory (A033493), sorted into ascending order. 1

%I #6 Sep 08 2022 08:46:17

%S 1,3,7,15,31,36,46,49,55,63,66,67,91,106,119,127,139,145,148,186,190,

%T 197,214,235,248,255,259,274,281,288,301,302,316,325,330,339,346,357,

%U 386,393,399,413,427,442,442,452,465,497,498,500,505,509,511,519,535,540

%N Values taken by the sum of numbers in Collatz trajectory (A033493), sorted into ascending order.

%C Values a(n) such that a(n) = a(n+1): 442, 609, 633, 724, 904, 925, ...

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/CollatzProblem.html">Collatz Problem</a>

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Collatz_conjecture">Collatz conjecture</a>

%o (Magma) Sort([&+[k eq 1 select n else IsOdd(Self(k-1)) and not IsOne(Self(k-1)) select 3*Self(k-1)+1 else Self(k-1) div 2: k in [1..5*n]]: n in [1..2^10] | &+[k eq 1 select n else IsOdd(Self(k-1)) and not IsOne(Self(k-1)) select 3*Self(k-1)+1 else Self(k-1) div 2: k in [1..5*n]] le 2^10])

%Y Cf. A033493, A275532.

%K nonn

%O 1,2

%A _Jaroslav Krizek_, Jul 31 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 11:37 EDT 2024. Contains 371968 sequences. (Running on oeis4.)