%I A113498
%S A113498 1,2,3,4,6,7,8,9,13,12,14,15,21,19,21
%N A113498 Ascending descending base exponent transform of omega(n) [A001221].
%F A113498 a(n) = SUM[from i = 1 to n] omega(n+1). a(n) = SUM[from i = 2 to n+1] 
               number of distinct primes dividing i. a(n) = SUM[from i = 1 to n] 
               A001221(n+1).
%e A113498 Since omega(n) = A001221(n) = 0, 1, 1, 1, 1, 2, 1, 1, 1, 2 and we skip 
               the initial zero term, we have:
%e A113498 a(1) = 1^1 = 1.
%e A113498 a(2) = 1^1 + 1^1 = 2.
%e A113498 a(3) = 1^1 + 1^1 + 1^1 = 3.
%e A113498 a(4) = 1^1 + 1^1 + 1^1 + 1^1 = 4.
%e A113498 a(5) = 1^1 + 1^1 + 1^1 + 1^1 + 2^1 = 6.
%e A113498 a(9) = 1^1 + 1^1 + 1^1 + 1^1 + 2^2 + 1^1 + 1^1 + 1^1 + 2^1 = 13.
%Y A113498 Cf. A001221, A113320, A005408, A113122, A113153, A113154, A113336, A113271, 
               A113258, A113257, A113231, A087316, A113208.
%Y A113498 Sequence in context: A134003 A128170 A018490 this_sequence A036796 A039123 
               A131618
%Y A113498 Adjacent sequences: A113495 A113496 A113497 this_sequence A113499 A113500 
               A113501
%K A113498 easy,nonn
%O A113498 2,2
%A A113498 Jonathan Vos Post (jvospost3(AT)gmail.com), Jan 10 2006