%I#15 2018年1月29日06:29:44
%S 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%温度1,2,2,1,2,0,1,0,0,1,1,2,0,2,0,1,12,1,2,2,2,0,3,3,1,2,1,0,1,
%U 1,3,2,4,1,2,1,1,3,1,3,1,2,2,3,0,4,4,1,4
%N将N划分为三素数的两个乘积的次数。
%H Indranil Ghosh,n表,n=1..1000时的a(n)</a>
%H<a href=“/index/Par#part”>与分区相关的序列的索引条目</a>
%F a(n)=总和{i=2..层(n/2)}A101605(i)*A101606(n-i)。
%e a(36)=2;36分为两部分,即三素数的乘积:(28,8)和(18,18)。
%p with(numtheory):A280830:=n->add(floor(bigomega(i)/3)*floor(3/bigomeka(i))*flower(3/bigamega(n-i))*floor(bingomega,n-i)/3,i=2..floor(n/2)):seq(A280830(n),n=1..100);
%t表[Sum[Floor[PrimeOmega[i]/3]Floor[3/PrimeOmega[i]]Floor[3]/PrimeOmega[n-i]]Floor[PrimeOmega[n-i]/3],{i,2,Floor[n/2]}],{n,1,90}](*_Indranil Ghosh_,2017年3月9日,翻译自Maple代码*)
%o(PARI)代表(n=1,90,打印1(总和(i=2,楼层(n/2),楼层(bigomega(i)/3)*楼层(3/bigomeka(i))*楼层
%Y参考A014612,A101605。
%K nonn,简单
%O 1,36号
%A_Wesley Ivan Hurt_,2017年1月8日
|