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 A366709 #7 Jan 04 2024 13:39:36
%S A366709 2,4,4,16,4,32,8,64,16,16,12,256,8,64,64,512,8,512,4,192,32,48,16,
%T A366709 4096,16,192,64,1024,32,8192,32,2048,192,64,512,16384,8,64,128,12288,
%U A366709 16,12288,32,3072,4096,256,8,262144,32,1024,64,6144,128,65536,192,8192
%N A366709 Number of divisors of 12^n-1.
%H A366709 Max Alekseyev, <a href="/A366709/b366709.txt">Table of n, a(n) for n = 1..310</a>
%F A366709 a(n) = sigma0(12^n-1) = A000005(A024140(n)).
%e A366709 a(3)=4 because 12^3-1 has divisors {1, 11, 157, 1727}.
%p A366709 a:=n->numtheory[tau](12^n-1):
%p A366709 seq(a(n), n=1..100);
%t A366709 DivisorSigma[0, 12^Range[100]-1]
%o A366709 (PARI) a(n) = numdiv(12^n-1);
%Y A366709 Cf. A000005, A024140, A046801, A070528, A366707, A366708, A366710, A366683.
%K A366709 nonn
%O A366709 1,1
%A A366709 _Sean A. Irvine_, Oct 17 2023