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
A115600 a(n) = numerator of b(n), where b(1) = 1, b(n+1) = sum{k=1 to n} b(k)^((-1)^(n-k)). +0
4
1, 1, 2, 4, 13, 43, 905, 15790, 92494147, 47283340087, 8845558976879378539, 2707131569835749037213946965347, 2980435288285565929467276114849756995199455683357 (list; graph; listen)
OFFSET

1,3

COMMENT

Next term has 80 digits and is too long to be shown. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 30 2006

EXAMPLE

{b(n)} begins 1, 1, 2, 4, 13/2, 43/4,...

So b(7) = 1 + 1 + 1/2 + 4 + 2/13 + 43/4 = 905/52, and therefore a(7) = 905.

MAPLE

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

CROSSREFS

Cf. A115587, A115601, A115602.

Sequence in context: A050624 A135501 A001548 this_sequence A007858 A005164 A058134

Adjacent sequences: A115597 A115598 A115599 this_sequence A115601 A115602 A115603

KEYWORD

frac,nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Mar 13 2006

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 30 2006

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 November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research