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 A226678 #5 Jun 27 2013 12:06:45 %S A226678 11,17,1,385,131,193,641,23,217,7775,57095,3689,1163,14185,8533,467, %T A226678 46199,20143,87089,15217,973,134809,14279 %N A226678 Smallest positive integer (or 0 if no such k) with conjecturally exactly n primitive cycles of positive integers under iteration by the Collatz-like 3x-k function. %C A226678 A cycle is called primitive if its elements are not a common multiple of the elements of another cycle. %C A226678 The 3x-k function T_k is defined by T_k(x) = x/2 if x is even, (3x-k)/2 if x is odd, where k is odd. %C A226678 For primitive cycles, GCD(k,6)=1 and k is in A226630. %C A226678 Conjecture: a(n)>0 for all n. %Y A226678 Cf. A226629, A226662. %K A226678 nonn %O A226678 1,1 %A A226678 _Geoffrey H. Morley_, Jun 25 2013