|
%I #4 May 09 2013 11:01:12
%S 1,2,3,4,6,7,8,9,11,12,13,14,16,17,18,19,21,22,23,24,26,27,28,29,31,
%T 32,33,34,36,37,38,39,41,42,43,44,46,47,48,49,51,52,54,56,57,58,59,61,
%U 62,63,64,66,67,68,69,71,72,73,74,76,77,78,79,81,82,83,84
%N Numbers having no balanced prime factors, cf. A006562.
%C a(n) = A047201(n) for n <= 42.
%H Reinhard Zumkeller, <a href="/A225496/b225496.txt">Table of n, a(n) for n = 1..5000</a>
%F Multiplicative closure of A178943; a(n) mod A006562(k) > 0 for all k.
%e a(40) = 49 = 7^2 = A178943(3)^2;
%e a(41) = 51 = 3 * 17 = A178943(2) * A178943(6);
%e a(42) = 52 = 2^2 * 13 = A178943(1)^2 * A178943(5);
%e a(43) = 54 = 2 * 3^3 = A178943(1) * A178943(2)^3;
%e a(44) = 56 = 2^3 * 7 = A178943(1)^3 * A178943(3);
%e a(45) = 57 = 3 * 19 = A178943(2) * A178943(7).
%o (Haskell)
%o import Data.Set (singleton, fromList, union, deleteFindMin)
%o a225496 n = a225496_list !! (n-1)
%o a225496_list = 1 : h (singleton p) ps [p] where
%o (p:ps) = a178943_list
%o h s xs'@(x:xs) ys
%o | m > x = h (s `union` (fromList $ map (* x) (1 : ys))) xs ys
%o | otherwise = m : h (s' `union` (fromList $ map (* m) ys')) xs' ys'
%o where ys' = m : ys; (m, s') = deleteFindMin s
%Y Cf. A225493 (strong), A225494 (balanced), A225495 (weak).
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, May 09 2013
|
