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 A136034 #19 Jan 10 2025 14:48:02
%S A136034 1,2,4,8,12,20,24,40,36,48,88,60,72,150,132,120,156,144,200,204,210,
%T A136034 180,324,476,288,300,432,396,480,360,468,576,700,504,420,648,540,660,
%U A136034 792,720
%N A136034 a(n) = smallest number k such that number of distinct prime factors of 2^k-1 is exactly n.
%C A136034 First occurrence of n in A046800.
%t A136034 With[{pn1=PrimeNu[2^Range[800]-1]},Table[Position[pn1,n,1,1],{n,0,40}]]//Flatten (* _Harvey P. Dale_, Jan 10 2025 *)
%o A136034 (PARI) a(n) = my(k=1); while (omega(2^k-1) != n, k++); k; \\ _Michel Marcus_, Jan 09 2023
%Y A136034 Cf. A000225, A003260, A016047, A046051, A046800, A049479, A088863, A136030, A136031, A136032, A136033.
%K A136034 nonn,more
%O A136034 0,2
%A A136034 _Artur Jasinski_, Dec 11 2007
%E A136034 More terms from _Julián Aguirre_, Feb 04 2013
%E A136034 a(31)-a(39) from _Chai Wah Wu_, Oct 03 2019
%E A136034 a(0) = 1 inserted by _Michel Marcus_, Jan 09 2023