The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A336994 Entries of A336938 without duplicates. 0

%I #12 Aug 16 2020 13:53:17

%S 0,4,16,52,160,9232,13120,39364,41524,250504,1276936,6810136,8153620,

%T 27114424,50143264,106358020,121012864,593279152,1570824736,

%U 2482111348,2798323360,17202377752

%N Entries of A336938 without duplicates.

%C Is this (apart from the first 2 entries) the same as A006885? - _R. J. Mathar_, Aug 16 2020

%o (PARI) firstMiss(A) = { my(i); if(#A == 0 || A[1] > 0, return(0)); for(i = 1, A[#A] + 1, if(!setsearch(A, i), return(i))); };

%o iter(A) = { my(a = firstMiss(A)); while(!setsearch(A, a), A = setunion(A, Set([a])); a = if(a % 2, 3*a+1, a/2)); A; };

%o makeVec(m) = { my(v = [], A = Set([0]), i); for(i = 1, m, if (length(v) == 0 || v[length(v)] != A[#A], v = concat(v, A[#A])); if (i < m, A = iter(A))); v; };

%o makeVec(10000)

%Y Cf. A336938.

%K nonn,more

%O 1,2

%A _Markus Sigg_, Aug 10 2020

%E a(16)-a(22) from _Jinyuan Wang_, Aug 13 2020

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 June 4 08:15 EDT 2024. Contains 373092 sequences. (Running on oeis4.)