<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META http-equiv=Content-Type content="text/html; charset=iso-2022-jp">
<META content="MSHTML 6.00.2900.2180" name=GENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=#ffffff>
<DIV><FONT face="MS UI Gothic" size=2> I submit
some sequences.</FONT></DIV>
<DIV><FONT face="MS UI Gothic" size=2></FONT> </DIV>
<DIV><FONT face="MS UI Gothic" size=2></FONT> </DIV>
<DIV> </DIV>
<DIV><FONT face="MS UI Gothic" size=2> %I
A000001<BR> %S A000001 2, 0, 2, 0, 2, 0, 0, 0, 0, 2, 2, 0, 0,
0, 0, 0, 2, 2, 0, 0, 0, 1, 1, 2, 0, 2, 0, 2, </FONT></DIV>
<DIV> </DIV>
<DIV><FONT face="MS UI Gothic" size=2> %N
A000001 a(n)=Prime(n)+Prime(n+k) , mod
3<BR>
k=1/2*(Prime(n+1)-Prime(n))
<BR> %O A000001 2,1
<BR> %Y A000001
A103270<BR> %K A000001
nonn<BR> %A A000001 Yasutoshi Kohmoto (<A
href="mailto:zbi74583@boat.zero.ad.jp">zbi74583@boat.zero.ad.jp</A>)</FONT></DIV>
<DIV> </DIV>
<DIV><FONT face="MS UI Gothic" size=2></FONT> </DIV>
<DIV> </DIV>
<DIV><FONT face="MS UI Gothic" size=2> </FONT></DIV>
<DIV> </DIV>
<DIV><FONT face="MS UI Gothic" size=2> %I
A000002<BR> %S A000002 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,
18, 13, 14, 15, 16, 17, 12, 19, 50, 21, 22, 23, 54, 25, 26, 27, 98, 29,
30,<BR> %T A000002 31, 32, 33, 34, 35, 36, 37, 38, 39, 250,
41, 42, 43, 242, 75, 46, 47, 162, 49, 20, 51, 338, 53, 24, 55, 686, 57, 58, 59,
90 <BR> %N A000002 a(n)=a( Product p_i^r_i ,
0<=i<=k ) = Product p_i^r_(i-1) , where p_0^r_(-1)=p_0^r_k
<BR> %C A000002 Permutation , 2<=n . The first term which
is different from A069799 is a(60).<BR> %e
A000002 a(60)=a(2^2*3*5)=2*3^2*5=90<BR> %O
A000002 2,1 <BR> %Y
A000002 A069799<BR> %K
A000002 nonn<BR> %A
A000002 Yasutoshi Kohmoto (<A
href="mailto:zbi74583@boat.zero.ad.jp">zbi74583@boat.zero.ad.jp</A>)</FONT></DIV>
<DIV><FONT face="MS UI Gothic" size=2></FONT> </DIV>
<DIV><FONT face="MS UI Gothic" size=2></FONT> </DIV>
<DIV><FONT face="MS UI Gothic" size=2></FONT> </DIV>
<DIV><FONT face="MS UI Gothic" size=2> %I
A000003<BR> %S A000003 2, 5, 11, 23, 47, 97, 197, 397, 797,
1597, 3209, 6449 <BR> %N A000003 a(n)=2*a(n-1)+k_n . k_n
is the smallest positive number such that k_{n-1}<=k_n , a(n) is Prime
<BR> %e A000003 1597+k is not prime for
3<=k<15<BR> %O A000003 2,1
<BR> %Y A000003
A000004<BR> %K A000003
nonn<BR> %A A000003 Yasutoshi Kohmoto (<A
href="mailto:zbi74583@boat.zero.ad.jp">zbi74583@boat.zero.ad.jp</A>)</FONT></DIV>
<DIV><FONT face="MS UI Gothic" size=2></FONT> </DIV><FONT
face="MS UI Gothic" size=2>
<DIV><BR> %I A000004<BR> %S A000004 0, 1, 1,
1, 1, 3, 3, 3, 3, 3, 15, 31<BR> %N A000004 k number of
A000003<BR> %C A000004 a(1)=0 is an artificial term for
A000003(1)<BR> %O A000004
1,5<BR> %Y A000004
A000003<BR> %K A000004
nonn<BR> %A A000004 Yasutoshi Kohmoto (<A
href="mailto:zbi74583@boat.zero.ad.jp">zbi74583@boat.zero.ad.jp</A>)
<BR> <BR> To Neil<BR>
question : <BR> How can I know number
of all sequences which I submitted to OEIS?<BR> </DIV>
<DIV> Yasutoshi</DIV>
<DIV> </FONT></DIV></BODY></HTML>