|
%I #10 Mar 31 2017 21:56:20
%S 1,2,3,2,5,3,7,2,3,7,11,3,13,7,7,2,17,3,19,7,7,11,23,3,5,15,3,7,29,7,
%T 31,2,11,19,7,3,37,19,15,7,41,7,43,11,7,23,47,3,7,7,19,15,53,3,15,7,
%U 19,31,59,7,61,31,7,2,13,11,67,19,23,7,71,3,73,39,7,19,15,15,79,7,3,43,83
%N In prime factorization of n replace multiplication with bitwise logical 'or'.
%C a(n) = a(A007947(n)); n is prime iff a(n)=n.
%H Paul Tek, <a href="/A072593/b072593.txt">Table of n, a(n) for n = 1..10000</a>
%e a(35) = a(5*7) = a(5) 'or' a(7) = '101' or '111' = '111' = 7.
%o (Haskell)
%o import Data.Bits (((.|.))
%o a072593 = foldl1 (.|.) . a027746_row -- _Reinhard Zumkeller_, Jul 05 2013
%Y Cf. A072591, A072594.
%Y Cf. A027746.
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Jun 23 2002
|
