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