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 A366652 #9 Jan 09 2024 22:32:04
%S A366652 2,6,4,24,8,32,12,96,8,96,16,512,16,144,64,768,32,160,16,4608,96,384,
%T A366652 16,8192,128,192,64,9216,64,4096,8,6144,256,1536,1536,10240,64,384,
%U A366652 512,73728,32,6144,32,24576,1024,384,64,262144,64,12288,256,147456,256
%N A366652 Number of divisors of 8^n-1.
%H A366652 Max Alekseyev, <a href="/A366652/b366652.txt">Table of n, a(n) for n = 1..500</a>
%F A366652 a(n) = sigma0(8^n-1) = A000005(A024088(n)).
%F A366652 a(n) = A046801(3*n). - _Max Alekseyev_, Jan 09 2024
%e A366652 a(5)=8 because 8^5-1 has divisors {1, 7, 31, 151, 217, 1057, 4681, 32767}.
%p A366652 a:=n->numtheory[tau](8^n-1):
%p A366652 seq(a(n), n=1..100);
%t A366652 DivisorSigma[0, 8^Range[100]-1]
%o A366652 (PARI) a(n) = numdiv(8^n-1);
%Y A366652 Cf. A024088, A000005, A057953, A059890, A366651, A366653, A366654.
%Y A366652 Cf. A046801, A366575, A366602, A366612, A366621, A366633, A366661, A070528, A366683, A366709.
%K A366652 nonn
%O A366652 1,1
%A A366652 _Sean A. Irvine_, Oct 15 2023