Sequences the same except for 1 term?

[Leroy Quet]

I submitted what is quoted below to seq.fan about a week ago, a time when 
the seq.fan server was having problems and also a discussion was taking 
place on some other topic.
So as a result, me post may not have gotten the proper attention.
(I received no replies.)

I repost it, asking for forgiveness for my doing so.

thanks,
Leroy Quet

Original email: 

>This is a two part email, part 1 is a math question, part 2 is a related 
>EIS etiquette question.
>
>===
>
>Below are posted 2 sequences of mine as recently expanded by Klaus 
>Brockhaus:
>
>Klaus Brockhaus wrote to me:
>>%I A113117
>>%S A113117 2,4,6,10,15,26,46,86,166,326,634,1262,2518,5006,10006,19946,39874,
>>%T A113117 79738,159398,318778,637502
>>%N A113117 a(1) = 2. a(n) is the lowest integer > a(n-1) such that all 
>>primes <= a(n-1) divide at least one integer k for a(n-1) < k <= a(n).
>>%e A113117 The primes <= a(5) = 15 are 2, 3, 5, 7, 11, and 13. So a(6) is 
>>the lowest integer >15 such that each prime <= 15 divides at least one 
>>integer between 16 and a(6). Setting a(6) to 26 = 2*13 satisfies the 
>>conditions. (2 divides 16. 3 divides 18. 5 divides 20. 7 divides 21. 11 
>>divides 22. And 13 divides 26.)
>>%o A113117 (PARI) 
>>{m=21;print1(a=2,",");for(n=2,m,nxt=a+1;forprime(p=1,a,k=a+1;while(k%p>0,k
>>++);nxt=max(nxt,k));print1(a=nxt,","))} - (Brockhaus)
>>%K A113117 more,nonn,new
>>%O A113117 1,1
>>%A A113117 Leroy Quet (qq-quet(AT)mindspring.com), Jan 03 2006
>>%E A113117 a(8) to a(21) from Klaus Brockhaus 
>>(klaus-brockhaus(AT)t-online.de), Jan 07 2006
>
>>%I A113118
>>%S A113118 2,4,6,10,14,26,46,86,166,326,634,1262,2518,5006,10006,19946,39874,
>>%T A113118 
>>79738,159398,318778,637502,1274998,2549978,5099902,10199786,20399534,
>>%U A113118 
>>40799062,81598082,163196134,326392258,652784498,1305568942,2611137838
>>%N A113118 a(1) = 2. a(n) is lowest integer > a(n-1) which is a multiple 
>>of the highest prime <= a(n-1).
>>%F A113118 a(n) = 2 * (highest prime <= a(n-1)), by Bertrand's postulate.
>>%e A113118 The greatest prime <= a(4) (= 10) is 7. The smallest multiple 
>>of 7 which is > 10 is 14. So a(5)= 14.
>>%o A113118 (PARI) 
>>{m=33;print1(a=2,",");for(n=2,m,p=precprime(a);k=a+1;while(k%p>0,k++);prin
>>t1(a=k,","))} - (Brockhaus)
>>%K A113118 nonn,new
>>%O A113118 1,1
>>%A A113118 Leroy Quet (qq-quet(AT)mindspring.com), Jan 03 2006
>>%E A113118 a(8) to a(33) from Klaus Brockhaus 
>>(klaus-brockhaus(AT)t-online.de), Jan 07 2006
>
>
>
>As some of you may have observed, the sequences are the same for the 
>given terms except for the 5th term, which is 14 for A113118 and is 15 
>for A113117.
>
>Question: Is the 5th term the only differing term among both sequences?
>
>(This seems like it would be an easy question to answer, yet I am having 
>some trouble.)
>
>---
>
>Question of etiquette:
>
>Assuming both sequences are indeed the same except for only 1 term, 
>should both sequences be in the EIS?
>
>I say yes, but mainly because the differing term is not the first terms 
>of the sequences.
>(There are plenty of examples where sequences are the same except for 
>their first terms.)
>
>It is easy enough for someone checking to see if a sequence is in the EIS 
>before submitting it to check the second and following terms only.
>But if the submitter checks if a sequence she/he wants to submit is in 
>the EIS, and sequence varies only in the 5th term from a sequence already 
>in the database, then the submitter will conclude his/her sequence is not 
>in the EIS and might be interesting enough to submit.
>
>thanks,
>Leroy Quet