2 Recursive Sequences Involving Prime Divisors

[Leroy Quet]

I cannot believe the first of these sequences is not yet in the EIS 
anyway.

a(1) = 1;

For m >= 2,

a(m) = sum{p|m} a(pi(p)),

where the sum is over the distinct prime divisors, p, of m,
and pi(p) is the order of p among the primes = the number of primes <= p.

1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 2, 2, 2, 1, 1, 2, 1, 2,...


Related:

b(1) = 1;

For m >= 2,

b(m) =sum{p does not divide m, p<m} b(pi(p)).


1, 0, 1, 0, 1, 1, 2, 1, 2, 0, 2, 2, 3, 3, 3, 3, 4, 5, 6, 5,...

(perhaps)

Does anyone know anything interesting about either of these sequences?

thanks,
Leroy Quet