login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A115587 a(n) = denominator of b(n), where b(1) = 1, b(n+1) = sum{k=1 to n} b(k)^((-1)^(n-k)). 3
1, 1, 1, 1, 2, 4, 52, 559, 2023580, 639046564, 73885083538076135, 13974134129149036419614094980, 9508386737708519692119190558953351866716894940, 167312950453078829361896561420857502596441619698513063185995475418519527687170 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

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) = 52.

MAPLE

b[1]:=1: for n from 1 to 14 do b[n+1]:=sum(b[k]^((-1)^(n-k)), k=1..n): a[n]:=denom(b[n]) od: seq(a[n], n=1..14); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 30 2006

CROSSREFS

Cf. A115600, A115601, A115602.

Sequence in context: A085325 A082661 A205616 * A018337 A092389 A005274

Adjacent sequences:  A115584 A115585 A115586 * A115588 A115589 A115590

KEYWORD

frac,nonn

AUTHOR

Leroy Quet Mar 13 2006

EXTENSIONS

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 05:29 EST 2012. Contains 205694 sequences.