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 A056692 #15 Oct 30 2017 08:32:20
%S A056692 1,1,1,2,1,2,1,3,2,2,1,3,1,2,3,4,1,3,1,4,2,2,1,5,2,2,3,4,1,2,1,5,3,2,
%T A056692 3,5,1,2,2,6,1,4,1,4,5,2,1,6,2,3,3,4,1,4,2,5,2,2,1,5,1,2,4,6,3,3,1,4,
%U A056692 3,4,1,8,1,2,4,4,3,4,1,7,4,2,1,6,3,2,3,6,1,4,3,4,2,2,3,8,1,3,5,6,1,3,1,6,4
%N A056692 Number of divisors k of n with gcd(k-1, n) = 1.
%H A056692 Antti Karttunen, <a href="/A056692/b056692.txt">Table of n, a(n) for n = 1..16384</a>
%e A056692 The positive divisors of 8 are 1, 2, 4, 8. (2-1), (4-1) and (8-1) are relatively prime to 8, so a(8) = 3.
%t A056692 Table[DivisorSum[n, 1 &, CoprimeQ[# - 1, n] &], {n, 105}] (* _Michael De Vlieger_, Oct 30 2017 *)
%o A056692 (PARI) A056692(n) = sumdiv(n,d,(1==gcd(d-1,n))); \\ _Antti Karttunen_, Oct 30 2017
%K A056692 nonn
%O A056692 1,4
%A A056692 _Leroy Quet_, Aug 10 2000