# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a159072
Showing 1-1 of 1

%I A159072 #3 Mar 30 2012 19:00:15
%S A159072 1,1,1,1,2,1,3,2,4,4,6,2,7,6,7,7,10,7,11,8,11,12,14,8,15,15,16,15,19,
%T A159072 13,20,17,20,21,22,17,25,24,25,21,28,23,29,26,26,30,32,24,33,31,34,33,
%U A159072 37,32,37,33,39,40,42,32,43,42,40,41,45,42,48,45,48,44,51,41,52,51,50,51,54
%N A159072 Count of numbers k in the range 1<=k<= n such that set of proper divisors of k is not a subset of the set of the proper divisors of n.
%C A159072 Here proper divisors include 1 but not the argument (k or n, respectively) in the divisor set, as defined in A032741.
%C A159072 We use the (nonstandard) terminology that the empty set (the proper divisors of 1) is not a subset of another set.
%F A159072 a(n)+A159070(n) = n. - _R. J. Mathar_, Apr 06 2009
%e A159072 a(8) = 2 counts k=6 with divisors set {1, 2, 3} (not subset of the divisors {1, 2, 4} of n = 8), and k=1 without proper divisors.
%Y A159072 Cf.: A158974, A000040, A036234, A000720.
%K A159072 nonn
%O A159072 1,5
%A A159072 _Jaroslav Krizek_, Apr 04 2009
%E A159072 Edited and extended by _R. J. Mathar_, Apr 06 2009

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE