sequences and question
kohmoto
zbi74583 at boat.zero.ad.jp
Fri Apr 8 09:18:16 CEST 2005
I submit some sequences.
%I A000001
%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,
%N A000001 a(n)=Prime(n)+Prime(n+k) , mod 3
k=1/2*(Prime(n+1)-Prime(n))
%O A000001 2,1
%Y A000001 A103270
%K A000001 nonn
%A A000001 Yasutoshi Kohmoto (zbi74583 at boat.zero.ad.jp)
%I A000002
%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,
%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
%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
%C A000002 Permutation , 2<=n . The first term which is different from
A069799 is a(60).
%e A000002 a(60)=a(2^2*3*5)=2*3^2*5=90
%O A000002 2,1
%Y A000002 A069799
%K A000002 nonn
%A A000002 Yasutoshi Kohmoto (zbi74583 at boat.zero.ad.jp)
%I A000003
%S A000003 2, 5, 11, 23, 47, 97, 197, 397, 797, 1597, 3209, 6449
%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
%e A000003 1597+k is not prime for 3<=k<15
%O A000003 2,1
%Y A000003 A000004
%K A000003 nonn
%A A000003 Yasutoshi Kohmoto (zbi74583 at boat.zero.ad.jp)
%I A000004
%S A000004 0, 1, 1, 1, 1, 3, 3, 3, 3, 3, 15, 31
%N A000004 k number of A000003
%C A000004 a(1)=0 is an artificial term for A000003(1)
%O A000004 1,5
%Y A000004 A000003
%K A000004 nonn
%A A000004 Yasutoshi Kohmoto (zbi74583 at boat.zero.ad.jp)
To Neil
question :
How can I know number of all sequences which I submitted to OEIS?
Yasutoshi
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.seqfan.eu/pipermail/seqfan/attachments/20050408/84bc5a6f/attachment.htm>
More information about the SeqFan
mailing list