Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096277
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A096277
%S A096277 13,20,30,42,54,66,78,94,112,128,146,162,174,190,212,232,248,266,282,
%T A096277 296,314,334,358,384,402,414,426,438,462,498,526,544,564,588,608,628,
%U A096277 650,670,692,712,732,756,774,786,806,844,884,906,918,934
%N A096277 Sum of successive sums of successive primes.
%C A096277 The first term is the only term that has a chance of being prime.
%F A096277 Let f(n) = prime(n) + prime(n+1) be the sum of the n-th and (n+1)-th 
               primes. Then f1(n1) = f(n1)+f(n1+1) is the general term of the sequence.
%e A096277 The sums of the first two successive primes are 5 and 8. 5+8 = 13 is 
               the first term in the sequence.
%o A096277 (PARI) f1(n) = for(x=1,n,print(f(x)+f(x+1)",")) f(n) = return(prime(n)+prime(n+1))
%Y A096277 Sequence in context: A164486 A164482 A058016 this_sequence A164476 A164466 
               A164475
%Y A096277 Adjacent sequences: A096274 A096275 A096276 this_sequence A096278 A096279 
               A096280
%K A096277 easy,nonn
%O A096277 1,1
%A A096277 Cino Hilliard (hillcino368(AT)gmail.com), Jun 22 2004

    
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 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research