[seqfan] Re: version 1 or 2?

[Robert G. Wilson v]

Why not both.

{0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 2, 1, 0, 0, 1, 1, 2, 1, 2, 0, 0, 1, 2, 0, 0, 1, 2, 1, 3, 1, 1, 0, 0, 0, 2, 1, 0, 0, 2, 1, 3, 1, 2, 2, 0, 1, 2, 0, 2, 0, 2, 1, 2, 0, 2, 0, 0, 1, 3, 1, 0, 2, 1, 0, 3, 1, 2, 0, 3, 1, 2, 1, 0, 2, 2, 0, 3, 1, 2, 1, 0, 1, 3, 0, 0, 0, 2, 1, 3, 0, 2, 0, 0, 0, 2, 1, 2, 2, 2, 1, 3, 1, 2, 3}
f[n_] := Length@ Select[ Divisors[n], !PrimeQ[#] && PrimeQ[n/#] &]; Array[f, 105]
Intersection of the terms of A033273 and A001221.



{1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 3, 1, 3, 1, 1, 1, 3, 1, 1, 2, 3, 1, 4, 1, 2, 1, 1, 1, 3, 1, 1, 1, 3, 1, 4, 1, 3, 3, 1, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 1, 1, 4, 1, 1, 3, 2, 1, 4, 1, 3, 1, 4, 1, 3, 1, 1, 3, 3, 1, 4, 1, 3, 2, 1, 1, 4, 1, 1, 1, 3, 1, 4, 1, 3, 1, 1, 1, 3, 1, 3, 3, 3, 1, 4, 1, 3, 4}
f[n_] := Length@ Select[ Divisors[n], ! PrimeQ[#] && (PrimeQ[n/#] || n == #) &]; Array[f, 105]
Intersection of the terms of A033273 and A083399.

Bob.
-----Original Message-----
From: SeqFan [mailto:seqfan-bounces at list.seqfan.eu] On Behalf Of Marc LeBrun
Sent: Friday, October 02, 2015 9:22 AM
To: Sequence Fanatics Discussion list
Subject: [seqfan] Re: version 1 or 2?

>="юрий герасимов" <2stepan at rambler.ru>

> 
.Dear SeqFans, 

version 1: number of nonprime diviisors d | n such that n/d
> is prime: 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 2, 1, 0, 0, 1, 1, 2, 1, 2, 
> 0, 0, 1, 2, 0, 0, 1, 2, 1, 3, 1, 1, 0, 0, 0, 2, 1, 0, 0, 2, 1, 3, 1, 
> 2, 2, 0, 1, 2, 0, 2, ...

version 2: number of nonprime divisors d | n such that n/d is
> noncomposite: 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 3, 1, 
> 3, 1, 1, 1, 3, 1, 1, 2, 3, 1, 4, 1, 2, 1, 1, 1, 3, 1, 1, 1, 3, 1, 4, 
> 1, 3, 3, 1, 1, 3, 1, 3 ...

Which version is suitable for OEIS?

Thanks.
> JSG

_______________________________________________

Seqfan Mailing list -
> http://list.seqfan.eu/


Both, please.



_______________________________________________

Seqfan Mailing list - http://list.seqfan.eu/