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 A086958 #3 Mar 30 2012 18:50:37 %S A086958 2,6,12,20,10,30,14,40,45,60,22,84,26,42,90,80,34,126,38,120,147,66, %T A086958 46,216,150,78,135,224,58,210,62,160,132,102,245,324,74,114,156,320, %U A086958 82,336,86,220,315,138,94,432,98,300,204,260,106,540,110,448,228,174 %N A086958 m such that A086956(m)=n and A086956(k)=n for exactly one k<m (k=A086957(n)). %C A086958 A086957(n) < a(n) < A086959(n), A086956(a(n))=A086956(A086957(n))=A086956(A086959(n)); %C A086958 n and A086956(n) are divisors of a(n); %C A086958 A086960(A086957(n)) = a(n), A086960(a(n)) = A086959(n); %C A086958 A086961(a(n)) = A086957(n), A086961(A086959(n)) = a(n); %C A086958 A086962(a(n)) = A086959(n), A086962(A086959(n)) = a(n); %C A086958 A086963(a(n)) = a(n); %C A086958 A086964(A086957(n)) = a(n), A086964(a(n)) = A086957(n). %Y A086958 Cf. A086938, A086939. %K A086958 nonn %O A086958 1,1 %A A086958 _Reinhard Zumkeller_, Jul 25 2003