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 A246909 #7 Sep 08 2022 08:46:09
%S A246909 -1,2,1,28,15456,831376
%N A246909 a(n) = the smallest numbers k such that sigma(k+sigma(k)) = n* sigma(k) or -1 if no solution exists or has been found for n.
%C A246909 a(7) > 10^7 or -1.
%e A246909 Sequence of numbers k such that sigma(k+sigma(k)) = n* sigma(k) for 1 <= n <= 6:
%e A246909 n = 2: 2, 3, 5, 11, 23, 29, 41, 53, 83, 89, 113, 131, 173, … (A246857).
%e A246909 n = 3: 1, 7, 26, 30, 42, 54, 69, 78, 84, 94, 102, 103, 114, … (A246910).
%e A246909 n = 4: 28, 66, 348, 496, 840, 920, 1320, 1416, 1602, 1770, … (A246911).
%e A246909 n = 5: 15456, 16920, 48576, 59520, 107160, 153360, 232596, … (A246912).
%e A246909 n = 6: 831376, 3944688, 16956576, 17843616, … (A246913).
%o A246909 (Magma) A246909:=func<n|exists(r){m: m in[1..1000000] | SumOfDivisors(m+SumOfDivisors(m))eq n*SumOfDivisors(m)}select r else-1>; [A246909(n): n in[1..10]]
%Y A246909 Cf. A000203, A246910, A246911, A246912, A246913, A246914.
%K A246909 sign
%O A246909 1,2
%A A246909 _Jaroslav Krizek_, Sep 07 2014