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 A381136 #22 Mar 09 2025 17:03:36
%S A381136 1,2,0,1,2,4,0,0,1,3,0,2,2,3,0,1,0,2,0,2,4,2,0,1,1,2,0,2,2,8,0,1,4,4,
%T A381136 0,1,2,3,0,2,2,7,0,1,2,4,0,1,0,2,0,2,0,2,0,2,4,2,0,3,2,2,0,1,4,8,0,2,
%U A381136 3,5,0,1,2,3,0,2,4,8,0,1,1,3,0,4,4,4,0
%N A381136 a(n) is the number of divisors d of n such that tau(d^(1 + n) + n) = 2^omega(d^(1 + n) + n), where tau = A000005 and omega = A001221.
%t A381136 Table[Length[Select[Divisors[n],DivisorSigma[0,#^(1+n)+n]==2^PrimeNu[#^(1+n)+n]&]],{n,45}] (* _James C. McMahon_, Mar 05 2025 *)
%o A381136 (Magma) [#[d: d in Divisors(n) | #Divisors(d^(1+n)+n) eq 2^#PrimeDivisors(d^(1+n)+n)]: n in [1..50]];
%o A381136 (PARI) a(n) = sumdiv(n, d, my(f=factor(d^(1 + n) + n)); numdiv(f) == 2^omega(f)); \\ _Michel Marcus_, Feb 15 2025
%Y A381136 Cf. A000005, A001221, A049533, A381138.
%K A381136 nonn
%O A381136 1,2
%A A381136 _Juri-Stepan Gerasimov_, Feb 15 2025
%E A381136 More terms from _Jinyuan Wang_, Mar 09 2025