Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054643
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A054643
%S A054643 3,47,151,167,199,251,257,367,503,523,557,587,601,647,727,941,971,991,
%T A054643 1063,1097,1117,1181,1217,1231,1361,1453,1493,1499,1531,1741,1747,1753,
%U A054643 1759,1889,1901,1907,2063,2161,2281,2393,2399,2411,2441,2671,2897,2957
%N A054643 Primes p(n) such that Mod[p(n)+p(n+1)+p(n+2),3]=0
%C A054643 The 2 differences of these 3 primes should be congruent of 6, except 
               the first prime 3, for which 3+5+7=15 holds. Sequences like A047948, 
               A052198 etc. are subsequences here.
%e A054643 For p(242)=1531, the sum is 4623, the mean is 1541 and the successive 
               differences are 6a=12 or 6b=6 resp.
%Y A054643 A034961, A034707, A024675, A052288, A047948, A052198.
%Y A054643 Sequence in context: A139845 A141850 A003551 this_sequence A122535 A058427 
               A142293
%Y A054643 Adjacent sequences: A054640 A054641 A054642 this_sequence A054644 A054645 
               A054646
%K A054643 nonn
%O A054643 1,1
%A A054643 Labos E. (labos(AT)ana.sote.hu), May 15 2000

    
page 1

Search completed in 0.001 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 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research