|
%I #18 Oct 01 2012 06:50:55
%S 1,2,4,5,8,10,16,17,20,32,40,41,58,64,80,128,160,185,197,219,254,256,
%T 281,320,377,512,589,640,843,917,964,1024,1247,1280,1652,1707,1804,
%U 1825,2048,2074,2157,2519,2560,2637,2642,2727,2771,3614,3755,3786,4046,4096,4227
%N Numbers n such that n appears in the partial sums of the m-almost primes, where m=bigomega(n).
%C A013918 is a subsequence. - _Zak Seidov_, Sep 17 2012
%C Or: Numbers n equal to the sum of the first k numbers x having bigomega(x)=bigomega(n), for some k. - _M. F. Hasler_, Sep 23 2012
%e 2 is in the sequence because 2 appears in A007504.
%e 4 is in the sequence because 4 appears in A062198.
%e 5 is in the sequence because 5 appears in A007504.
%e 6 is not in the sequence because 6 is not in A062198.
%e 8 is in the sequence because 8 appears in A086062,
%e 10 is in the sequence because 10 appears in A062198.
%p alm := proc(n,m) # n-th m-almost prime
%p option remember;
%p if n =1 then
%p 2^m ;
%p else
%p for a from procname(n-1,m)+1 do
%p if numtheory[bigomega](a) = m then
%p return a;
%p end if;
%p end do:
%p end if;
%p end proc:
%p almP := proc(n,m) #n-th partial sum of the m-almost primes
%p add(alm(i,m),i=1..n) ;
%p end proc:
%p isA216686 := proc(n) # is n in the sequence?
%p local m ,k,ps;
%p m := numtheory[bigomega](n) ;
%p for k from 1 do
%p ps := almP(k,m) ;
%p if ps = n then
%p return true;
%p elif ps > n then
%p return false;
%p end if;
%p end do:
%p end proc:
%p for n from 1 to 4300 do
%p if isA216686(n) then
%p printf("%d,",n) ;
%p end if;
%p end do: # _R. J. Mathar_, Sep 14 2012
%o (PARI) is_A216686(n)={ my(m=bigomega(n),t); while(n>0, while(bigomega(t++)!=m,); n-=t); !n} \\ - _M. F. Hasler_, Sep 23 2012
%Y Cf. A001222, A007504, A013918, A062198, A092190, A086052, A086062.
%K nonn,easy
%O 1,2
%A _Gerasimov Sergey_, Sep 13 2012
%E Corrected by _R. J. Mathar_, Sep 14 2012
|
