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 A366688 #9 Mar 17 2025 11:44:56
%S A366688 2,6,4,18,4,12,16,12,8,48,8,96,16,48,32,144,8,48,32,96,16,72,16,96,
%T A366688 128,48,8,240,64,48,64,96,16,4608,64,1152,128,24,16,1152,32,48,512,24,
%U A366688 64,3072,64,96,32,192,64,1152,8,96,512,6144,128,2304,64,96,256,48
%N A366688 Number of divisors of 11^n+1.
%H A366688 Max Alekseyev, <a href="/A366688/b366688.txt">Table of n, a(n) for n = 0..325</a>
%F A366688 a(n) = sigma0(11^n+1) = A000005(A034524(n)).
%e A366688 a(4)=4 because 11^4+1 has divisors {1, 2, 7321, 14642}.
%p A366688 a:=n->numtheory[tau](11^n+1):
%p A366688 seq(a(n), n=0..100);
%t A366688 DivisorSigma[0,11^Range[0,70]+1] (* _Harvey P. Dale_, Mar 17 2025 *)
%o A366688 (PARI) a(n) = numdiv(11^n+1);
%Y A366688 Cf. A034524, A000005, A062308, A366683, A366686, A366687, A366689, A366690.
%Y A366688 Cf. A046798, A344897, A366714.
%K A366688 nonn
%O A366688 0,1
%A A366688 _Sean A. Irvine_, Oct 16 2023