Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115600
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A115600
%S A115600 1,1,2,4,13,43,905,15790,92494147,47283340087,8845558976879378539,
%T A115600 2707131569835749037213946965347,
%U A115600 2980435288285565929467276114849756995199455683357
%N A115600 a(n) = numerator of b(n), where b(1) = 1, b(n+1) = sum{k=1 to n} b(k)^((-1)^(n-k)).
%C A115600 Next term has 80 digits and is too long to be shown. - Emeric Deutsch 
               (deutsch(AT)duke.poly.edu), Apr 30 2006
%H A115600 Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> 
               (listed in lieu of email address)
%e A115600 {b(n)} begins 1, 1, 2, 4, 13/2, 43/4,...
%e A115600 So b(7) = 1 + 1 + 1/2 + 4 + 2/13 + 43/4 = 905/52 and therefore a(7) = 
               905.
%p A115600 b[1]:=1: for n from 1 to 14 do b[n+1]:=sum(b[k]^((-1)^(n-k)),k=1..n) 
               od: seq(numer(b[n]),n=1..14); - Emeric Deutsch (deutsch(AT)duke.poly.edu), 
               Apr 30 2006
%Y A115600 Cf. A115587, A115601, A115602.
%Y A115600 Sequence in context: A050624 A135501 A001548 this_sequence A007858 A153930 
               A005164
%Y A115600 Adjacent sequences: A115597 A115598 A115599 this_sequence A115601 A115602 
               A115603
%K A115600 frac,nonn
%O A115600 1,3
%A A115600 Leroy Quet Mar 13 2006
%E A115600 More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 30 2006

    
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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research