This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A246436 #6 May 27 2018 14:23:02 %S A246436 0,0,0,1,1,0,2,4,2,4,4,3,6,4,8,11,8,4,8,12,15,10,14,13,11,16,17,12,15, %T A246436 19,21,26,16,22,26,16,19,21,21,31,28,34,23,28,31,34,34,36,29,29,33,40, %U A246436 43,36,40,36,33,39,37,44,47,45,48,57,42,41,45,53,56 %N A246436 Number of numbers 1,...,n not occurring in the Collatz trajectory starting with n. %C A246436 a(n) = n - A159999(n). %H A246436 Reinhard Zumkeller, <a href="/A246436/b246436.txt">Table of n, a(n) for n = 1..10000</a> %H A246436 <a href="/index/3#3x1">Index entries for sequences related to 3x+1 (or Collatz) problem</a> %e A246436 8-4-2-1: a(8) = #{3,5,6,7} = 4; %e A246436 9-28-14-7-22-11-34-17-52-26-13-40-20-10-5-16-8-4-2-1: a(9) = #{3,6} = 2; %e A246436 10-5-16-8-4-2-1: a(10) = #{3,6,7,9} = 4; %e A246436 11-34-17-52-26-13-40-20-10-5-16-8-4-2-1: a(11) = #{3,6,7,9} = 4; %e A246436 12-6-3-10-5-16-8-4-2-1: a(12) = #{7,9,11} = 3. %t A246436 Table[Length[Complement[Range[n],NestWhileList[If[EvenQ[#],#/2,3#+1]&,n,#>1&]]],{n,70}] (* _Harvey P. Dale_, May 27 2018 *) %o A246436 (Haskell) %o A246436 import Data.List ((\\), genericIndex) %o A246436 a246436 n = length $ [1..n] \\ genericIndex a220237_tabf (n - 1) %Y A246436 Cf. A159999, A220237, A070165. %K A246436 nonn %O A246436 1,7 %A A246436 _Reinhard Zumkeller_, Sep 01 2014