Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095237
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A095237
%S A095237 1,3,11,61,379,2731,22301,203897,2064455,22938391,277554529,3633441109,
%T A095237 51170962283,771500662115,12399117783989,211611610180081,
%U A095237 3822234708877711,72847296804492847,1460993008134550985
%N A095237 a(1)=1; then for n even, a(n)=(sum of previous terms times n) plus 1, 
               for n odd, a(n)=(sum of previous terms times n) minus 1.
%C A095237 Conjecture: There are infinitely many primes in this sequence.
%C A095237 The sequence would have been a little nicer if the even terms had a minus 
               one and the odd a plus one, so the first term would not have to be 
               an exception.
%o A095237 (PARI) a=vector(100) s=1 for(i=2,100,if(Mod(i,2)==0,a[i]=s*i+1,a[i]=s*i-1);
               s+=a[i])
%Y A095237 Cf. A095236.
%Y A095237 Sequence in context: A076475 A125556 A127516 this_sequence A024528 A004108 
               A069725
%Y A095237 Adjacent sequences: A095234 A095235 A095236 this_sequence A095238 A095239 
               A095240
%K A095237 nonn
%O A095237 1,2
%A A095237 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 13 2004
%E A095237 Edited by Johan Claes (Johan.Claes(AT)luc.ac.be), Jun 16 2004

    
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 9 14:39 EST 2009. Contains 170430 sequences.


AT&T Labs Research