Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039705
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A039705
%S A039705 2,3,5,0,4,6,3,5,2,1,3,2,6,1,5,4,3,5,4,1,3,2,6,5,6,3,5,2,4,1,1,5,4,6,2,
%T A039705 4,3,2,6,5,4,6,2,4,1,3,1,6,3,5,2,1,3,6,5,4,3,5,4,1,3,6,6,3,5,2,2,1,4,6,
%U A039705 3,2,3,2,1,5,4,5,2,3,6,1,4,6,5,2,1,2,6,1
%N A039705 a(n) = n-th prime modulo 7.
%C A039705 a(A049084(A045370(n-1))) = even; a(A049084(A045415(n-1))) = odd. - Reinhard 
               Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 25 2008
%H A039705 R. Zumkeller, <a href="b039705.txt">Table of n, a(n) for n = 1..1000</
               a>
%Y A039705 Cf. A039703, A039709.
%Y A039705 Sequence in context: A144804 A118308 A068909 this_sequence A082118 A079344 
               A096535
%Y A039705 Adjacent sequences: A039702 A039703 A039704 this_sequence A039706 A039707 
               A039708
%K A039705 nonn
%O A039705 1,1
%A A039705 Clark Kimberling (ck6(AT)evansville.edu)

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 5 08:23 EST 2009. Contains 170348 sequences.


AT&T Labs Research