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 A236022 #11 Jan 21 2014 08:11:06 %S A236022 4,9,6,8,10,25,14,15,12,22,16,21,49,26,27,18,34,33,20,38,35,39,46,121, %T A236022 28,51,58,169,24,62,57,55,32,74,69,65,82,30,86,289,94,77,87,44,85,93, %U A236022 106,361,45,91,95,50,118,36,52,122,111,40,42,134,123,115,142 %N A236022 Composite numbers n sorted by increasing values of gamma(n) = log_2(n+1) - log_tau(n) (sigma(n)), where sigma(n) = A000203(n) = the sum of divisors of n and tau(n) = A000005(n) = the number of divisors of n. %C A236022 The number gamma(n) = log_2(n+1) - log_tau(n) (sigma(n)) is called the gamma-deviation from primality of the number n; gamma(p) = 0 for p = prime. %C A236022 Conjecture: every natural number n has a unique value of gamma(n). %C A236022 For number 4; gamma(4) = log_2 (4+1) - log_tau(4) (sigma(4)) = log_2 (5) - log_3 (7) = 0,5506843457… = A236023 (minimal value of function gamma(n)). %C A236022 See A234516, A234520 and A236025 for definitions of functions alpha(n), beta(n) and delta(n). %C A236022 See A236024 - sequence of numbers from a(n) such that a(n) > a(k) for all k < n. %H A236022 Jaroslav Krizek, <a href="/A236022/b236022.txt">Table of n, a(n) for n = 1..1000</a> %Y A236022 Cf. A236020, A236021, A236023, A236024, A236025, A236026. %K A236022 nonn %O A236022 1,1 %A A236022 _Jaroslav Krizek_, Jan 18 2014