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 A133374 #12 Feb 16 2025 08:33:06 %S A133374 0,0,0,0,1,2,2,7,10,14,31,40,61,103,154,217,319,550,709,1111,1720, %T A133374 2233,3655,5338,7310,11683,16804,22477,35083,52750,68653,106291, %U A133374 161860,214597,320695,486244,652549,981235,1495324,1962505,2984647,4541086 %N A133374 Difference between largest number of complexity n in the sense of A005245 and smallest number of complexity n in the sense of A005245. %C A133374 Complexity of n: number of 1's required to build n using + and *. The complexity of a number has been defined in several different ways by different authors. See the Index to the OEIS for other definitions. %H A133374 Janis Iraids, <a href="/A133374/b133374.txt">Table of n, a(n) for n = 1..89</a> %H A133374 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/IntegerComplexity.html">Integer Complexity</a> %F A133374 a(n) = A000792(n) - A005520(n). %e A133374 n A000792(n)-A005520(n) = a(n) %e A133374 1 1 - 1 = 0. %e A133374 2 2 - 2 = 0. %e A133374 3 3 - 3 = 0. %e A133374 4 4 - 4 = 0. %e A133374 5 6 - 5 = 1. %e A133374 6 9 - 7 = 2. %e A133374 7 12 - 10 = 2. %e A133374 8 18 - 11 = 7. %e A133374 9 27 - 17 = 10. %e A133374 10 36 - 22 = 14. %e A133374 11 54 - 23 = 31. %e A133374 12 81 - 41 = 40. %e A133374 13 108 - 47 = 61. %e A133374 14 162 - 59 = 103. %e A133374 15 243 - 89 = 154. %e A133374 16 324 - 107 = 217. %e A133374 17 486 - 167 = 319. %e A133374 18 729 - 179 = 550. %e A133374 19 972 - 263 = 709. %e A133374 20 1458 - 347 = 1111. etc. %Y A133374 Cf. A000792, A005245, A005520, A133344. %K A133374 nonn %O A133374 1,6 %A A133374 _Jonathan Vos Post_, Oct 28 2007 %E A133374 Corrected and extended by _Janis Iraids_, Apr 20 2011