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 A132882 #14 Jul 16 2014 08:53:26
%S A132882 1,0,4,4,6,6,8,12,13,15,12,18,14,21,24,28,18,33,20,30,32,33,24,50,31,
%T A132882 39,40,53,30,55,32,60,48,51,48,81,38,57,56,78,42,77,44,81,78,69,48,
%U A132882 114,57,90,72,95,54,114,72,102,80,87,60,147,62,93,104,124,84,138,68,123,96
%N A132882 a(n) = the sum of the positive isolated divisors of n.
%C A132882 A divisor, d, of n is isolated if neither (d-1) nor (d+1) divides n.
%C A132882 The convention for 1 is that it is an isolated divisor iff n is not even. - _Olivier Gérard_, Sep 22 2007
%H A132882 Jens Kruse Andersen, <a href="/A132882/b132882.txt">Table of n, a(n) for n = 1..10000</a>
%F A132882 a(n) = A000203(n) - A132748(n), where A000203 is sigma(n), sum of divisors of n.
%e A132882 The positive divisors of 56 are: 1,2,4,7,8,14,28,56. Of these, 1 and 2 are adjacent and 7 and 8 are adjacent. The isolated divisors are therefore 4,14, 28,56. So a(56) = 4 +14 +28 +56 = 102.
%t A132882 Table[Plus@@Select[Divisors[n],(#==1||Mod[n,#-1]>0)&&Mod[n,#+1]>0&],{n,1,200}] (* _Olivier Gérard_, Sep 22 2007 *)
%Y A132882 Cf. A132881, A132748.
%K A132882 nonn
%O A132882 1,3
%A A132882 _Leroy Quet_, Sep 03 2007
%E A132882 More terms from _Olivier Gérard_, Sep 22 2007