|
%I #9 May 15 2014 10:20:00
%S 0,0,0,0,1,0,0,1,0,0,1,2,0,1,0,1,0,0,1,2,0,0,1,0,1,0,1,2,3,0,0,1,2,0,
%T 0,1,2,0,1,0,1,0,0,1,2,3,0,1,0,1,0,1,2,0,1,2,0,0,1,2,0,0,1,2,3,4,0,1,
%U 0,1,0,1,0,1,2,3,0,0,1,0,1,0,1,2,3,0,0,1,2,0,0,1,2,0,1,2,0,1,0,0,1,2,3,4,0,1,0,1,2,0,1,0,1,2,0,0,1,2,3,0
%N After a(1)=0, numbers 0 .. bigomega(n)-1, followed by numbers 0 .. bigomega(n+1)-1, etc., where bigomega(n)=A001222(n) is the number of prime factors of n (with repetition).
%H Antti Karttunen, <a href="/A241910/b241910.txt">Table of n, a(n) for n = 1..10000</a>
%F a(1)=0, a(n) = n - A022559(A082288(n)-1) - 2.
%e Viewed as an irregular table, the sequence is constructed as:
%e "Row"
%e [1] 0; (by convention, a(1)=0)
%e [2] 0; (because bigomega(2)=1, we have here terms from 0 to 0)
%e [3] 0; (same with 3, bigomega(3)=1)
%e [4] 0, 1; (as bigomega(4)=2, we have terms from 0 to 2-1)
%e [5] 0;
%e [6] 0, 1;
%e [7] 0;
%e [8] 0, 1, 2; (as bigomega(8)=3, we have terms from 0 to 3-1).
%e etc.
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define (A241910 n) (if (= n 1) 0 (- n (+ 2 (A022559 (- (A082288 n) 1))))))
%Y One less than A241911.
%Y Cf. A022559, A082288, A112798, A241914.
%K nonn,tabf
%O 1,12
%A _Antti Karttunen_, May 01 2014
|
