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 A352792 #14 Apr 05 2022 17:08:21 %S A352792 0,1,2,2,4,4,6,7,5,7,10,9,11,10,14,6,15,17,15,10,20,16,22,18,22,12,26, %T A352792 14,28,21,28,31,23,28,33,24,29,37,22,39,26,39,30,27,41,37,45,35,47,49, %U A352792 28,50,52,29,51,55,41,50,58,40,49,44,52,45,54,44,53,47 %N A352792 a(n) is the number of numbers k < n such that A109812(k) < A109812(n). %H A352792 Rémy Sigrist, <a href="/A352792/b352792.txt">Table of n, a(n) for n = 1..10000</a> %H A352792 Rémy Sigrist, <a href="/A352792/a352792.png">Scatterplot of the first 100000 terms</a> %H A352792 Rémy Sigrist, <a href="/A352792/a352792.txt">C++ program</a> %F A352792 a(n) <= n-1 with equality iff n belongs to A352204. %e A352792 The initial values of a(n), b(n) = A109812(n), and the corresponding k's, are: %e A352792 n a(n) b(n) k's %e A352792 -- ---- ---- --------------------------------------------------- %e A352792 1 0 1 [] %e A352792 2 1 2 [1] %e A352792 3 2 4 [1, 2] %e A352792 4 2 3 [1, 2] %e A352792 5 4 8 [1, 2, 3, 4] %e A352792 6 4 5 [1, 2, 3, 4] %e A352792 7 6 10 [1, 2, 3, 4, 5, 6] %e A352792 8 7 16 [1, 2, 3, 4, 5, 6, 7] %e A352792 9 5 6 [1, 2, 3, 4, 6] %e A352792 10 7 9 [1, 2, 3, 4, 5, 6, 9] %e A352792 11 10 18 [1, 2, 3, 4, 5, 6, 7, 8, 9, 10] %e A352792 12 9 12 [1, 2, 3, 4, 5, 6, 7, 9, 10] %e A352792 13 11 17 [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12] %e A352792 14 10 14 [1, 2, 3, 4, 5, 6, 7, 9, 10, 12] %e A352792 15 14 32 [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14] %e A352792 16 6 7 [1, 2, 3, 4, 6, 9] %e A352792 17 15 24 [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16] %o A352792 (C++) See Links section. %Y A352792 Cf. A109812, A352204. %K A352792 nonn %O A352792 1,3 %A A352792 _Rémy Sigrist_, Apr 03 2022