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 A376567 #39 Oct 25 2024 13:22:19
%S A376567 1,2,2,3,2,6,2,4,3,6,2,10,2,6,6,5,2,10,2,10,6,6,2,15,3,6,4,10,2,20,2,
%T A376567 6,6,6,6,15,2,6,6,15,2,20,2,10,10,6,2,21,3,10,6,10,2,15,6,15,6,6,2,35,
%U A376567 2,6,10,7,6,20,2,10,6,20,2,21,2,6,10,10,6,20,2
%N A376567 a(n) = binomial(bigomega(n) + omega(n), omega(n)), where bigomega = A001222 and omega = A001221.
%C A376567 For prime power p^k, a(p^k) = A010846(p^k) = A000005(p^k) = k+1. Therefore, for prime p, a(p) = A010846(p) = A000005(p) = 2.
%C A376567 For n in A024619, a(n) != A010846(n) and A010846(n) > A000005(n).
%H A376567 Michael De Vlieger, <a href="/A376567/b376567.txt">Table of n, a(n) for n = 1..10000</a>
%F A376567 a(n) = length of row n of A376248.
%F A376567 a(n) = A010846(n) - A376846(n) + A376847(n).
%p A376567 with(NumberTheory):
%p A376567 a := n -> binomial(Omega(n) + Omega(n, distinct), Omega(n, distinct)):
%p A376567 seq(a(n), n = 1..79); # _Peter Luschny_, Oct 25 2024
%t A376567 Array[Binomial[#2 + #1, #1] & @@ {PrimeNu[#], PrimeOmega[#]} &, 120]
%Y A376567 Cf. A000005, A001221, A001222, A007947, A010846, A024619, A068795, A376248, A376846, A376847.
%K A376567 nonn,easy
%O A376567 1,2
%A A376567 _Michael De Vlieger_, Oct 09 2024