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 A275109 #14 Aug 03 2016 10:42:09 %S A275109 1,1,1,1,6,1,1,1,3,1,12,1,3,1,1,1,1,8,1,3,1,3,1,1,1,3,1,3,1,13,1,1,1, %T A275109 3,1,8,1,3,1,1,1,6,1,3,3,1,1,1,1,3,1,1,14,1,1,1,1,1,6,1,3,1,1,1,1,1,1, %U A275109 3,1,1,1,3,6,1,1,1,1,3,1,1,1,8,1,3,1,3 %N A275109 Number of times each term of the sequence A025586 (largest value in Collatz trajectory of n) occurs. %C A275109 The possible values of the sequence A025586 are in A033496. Value A033496(n) occurs exactly a(n) times. %e A275109 a(5) = 6 because there is 6 numbers m such that A025586(m) = A033496(5) = 16: 3, 5, 6, 10, 12 and 16. %e A275109 See A095387; there is 1579 numbers m such that A025586(m) = 9232 = A033496(940); a(940) = 1579. %Y A275109 Cf. A025586, A033496. %K A275109 nonn %O A275109 1,5 %A A275109 _Jaroslav Krizek_, Jul 16 2016