Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089709
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A089709 a(1) = 1, a(2) = 2; for n>2, a(n) = sum_{r=1..n} {sum of all previous terms taken r at a time}. +0
2
1, 2, 6, 36, 360, 6480, 220320, 14541120, 1890345600, 487709164800, 250682510707200, 257200255985587200, 527260524770453760000, 2160713630509319508480000, 17704887488393364052485120000 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n)=(2^(n-2)+2)*a(n-1), n>3. - Vladeta Jovovic (vladeta(AT)eunet.rs), Nov 17 2003

EXAMPLE

a(4) = [{a(1)} + {a(2)} + {a(3)}] + [{(a(1) + a(2)} + {a(1) + a(3)} + { a(2) + a(3)}] + [{a(1) + a(2) + a(3)}] = 36.

CROSSREFS

Cf. A089985.

Sequence in context: A061302 A133822 A133892 this_sequence A055512 A078973 A152480

Adjacent sequences: A089706 A089707 A089708 this_sequence A089710 A089711 A089712

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 14 2003

EXTENSIONS

More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 21 2003

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


AT&T Labs Research