Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115587
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115587 a(n) = denominator of b(n), where b(1) = 1, b(n+1) = sum{k=1 to n} b(k)^((-1)^(n-k)). +0
4
1, 1, 1, 1, 2, 4, 52, 559, 2023580, 639046564, 73885083538076135, 13974134129149036419614094980, 9508386737708519692119190558953351866716894940, 167312950453078829361896561420857502596441619698513063185995475418519527687170 (list; graph; listen)
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: A032019 A085325 A082661 this_sequence A018337 A092389 A005274

Adjacent sequences: A115584 A115585 A115586 this_sequence A115588 A115589 A115590

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), Mar 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 July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research