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 A258914 #15 Dec 19 2024 06:16:19 %S A258914 12,18,24,31,32,42,48,54,56,60,72,80,84,90,96,98,104,108,114,120,126, %T A258914 128,132,140,144,152,156,168,180,182,186,192,210,216,224,228,234,240, %U A258914 248,252,264,270,272,280,288,294,308,312,320,324,336,342,360,372,384 %N A258914 Numbers k such that A258913(k) > k. %C A258914 The first k of the form k = 6m-1 in this sequence is 86831. %C A258914 What can be said about the asymptotic distribution of this set? If f(x) is the count of members not exceeding x, how does f behave as x tends to infinity? %H A258914 Giovanni Resta, <a href="/A258914/b258914.txt">Table of n, a(n) for n = 1..10000</a> %H A258914 Max Alekseyev, <a href="https://oeis.org/wiki/User:Max_Alekseyev/gpscripts">PARI/GP Scripts for Miscellaneous Math Problems</a> (invphi.gp). %H A258914 Mathematics Stack Exchange, <a href="http://math.stackexchange.com/questions/1126988/">A number n which is the sum of all numbers k with sigma(k)=n?</a> %o A258914 (PARI) is_a(n)=sum(k=1,n,if(sigma(k)==n,k))>n %o A258914 (PARI) is(k) = vecsum(invsigma(k)) > k; \\ _Amiram Eldar_, Dec 19 2024, using _Max Alekseyev_'s invphi.gp %Y A258914 Cf. A258913, A000203, A085790. %K A258914 nonn %O A258914 1,1 %A A258914 _Jeppe Stig Nielsen_, Jun 14 2015