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 A243865 #30 Mar 22 2024 04:22:46
%S A243865 0,0,2,2,0,2,0,2,2,0,0,5,0,0,3,2,0,2,0,2,2,0,0,6,0,0,2,2,0,3,0,2,2,0,
%T A243865 2,5,0,0,2,4,0,2,0,2,3,0,0,6,0,0,2,2,0,2,0,2,2,0,0,8,0,0,4,2,0,2,0,2,
%U A243865 2,2,0,6,0,0,3,2,0,2,0,4,2,0,0,7,0,0,2,2,0,3,0,2,2,0,0,6
%N A243865 Number of twin divisors of n.
%C A243865 A divisor m of n is a twin divisor if m-2 (for m >= 3) and m+2 (for m <= n-2) also divide n.
%H A243865 Jens Kruse Andersen, <a href="/A243865/b243865.txt">Table of n, a(n) for n = 1..10000</a>
%F A243865 a(n) = A000005(n) - A243917(n).
%F A243865 a(3n) > 1 for all n >= 1.
%F A243865 a(A099477(n)) = 0, a(A059267(n)) > 0.
%F A243865 A099475(n) <= a(n) <= A000005(n).
%F A243865 Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = log(2)/2 + 17/12 = 1.7632402569... . - _Amiram Eldar_, Mar 22 2024
%e A243865 The positive divisors of 20 are 1, 2, 4, 5, 10, 20. Of these, 2 and 4 are twin divisors: (2)+2 = 4, which divides n, and (4)-2 = 2 also divides n. So a(20) = the number of these divisors, which is 2.
%o A243865 (PARI) a(n) = sumdiv(n, d, ((d>2) && !(n % (d-2))) || !(n % (d+2))); \\ _Michel Marcus_, Jun 25 2014
%Y A243865 Cf. A000005, A002162, A099475, A132747, A243917.
%K A243865 nonn
%O A243865 1,3
%A A243865 _Juri-Stepan Gerasimov_, Jun 13 2014