|
%I #17 Aug 02 2019 20:54:16
%S 1,1,2,1,3,1,4,1,2,1,1,1,8,1,2,1,1,1,12,1,2,1,1,1,16,1,2,5,1,1,19,1,1,
%T 1,1,1,2,1,3,1,1,1,2,1,1,1,1,1,1,1,2,1,2,1,1,1,1,1,1,1,2,1,2,2,2,1,1,
%U 1,1,6,1,1,2,1,1,1,8,11,8,1,2,1,12,1,1,1,9
%N a(0) = 1; a(n) = gcd((number of earlier terms which are coprime to n), (sum of the earlier terms which are coprime to n)).
%H Diana L. Mecum, <a href="/A128267/b128267.txt">Table of n, a(n) for n = 0..1677</a>
%e The terms among {a(0),a(1),...,a(7)} that are coprime to 8 are a(0)=1, a(1)=1, a(3)=1, a(4)=3, a(5)=1 and a(7)=1. There are 6 such terms and the sum of these terms is 8. So a(8) = gcd(6,8) = 2.
%Y Cf. A128268.
%K nonn
%O 0,3
%A _Leroy Quet_, Feb 22 2007
%E More terms from _Diana L. Mecum_, Aug 06 2012
|
