Same sequence except for first term

[N. J. A. Sloane]

Leroy said


Yesterday I sent these 2 sequences (along with the a(1)=3 and a(1)=5 
cases):

%S A000001 2, 0, 1, 1, 3, 2, 5, 4
%N A000001 a(n) = number of terms among {a(1),a(2),a(3),...a(n-1)} which 
are coprime to n; a(1)=2.
%C A000001 A family of related sequences can be generated using different 
positive integers for a(1). (a(1)=1 is sequence A096216.)
%Y A000001 A096216
%O A000001 1
%K A000001 ,more,nonn,
%A A000001 Leroy Quet (qq-quet at mindspring.com), Aug 27 2004

%S A000001 4, 0, 1, 1, 3, 2, 5, 4
%N A000001 a(n) = number of terms among {a(1),a(2),a(3),...a(n-1)} which 
are coprime to n; a(1)=4.
%C A000001 A family of related sequences can be generated using different 
positive integers for a(1). (a(1)=1 is sequence A096216.)
%Y A000001 A096216
%O A000001 1
%K A000001 ,more,nonn,
%A A000001 Leroy Quet (qq-quet at mindspring.com), Aug 27 2004


which are the same sequences except that a(1) does not equal b(1).


Me:  in this case I think just the first example will suffice. Superseeker would catch the other one

NJAS