Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116690
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116690 C(n,8) + C(n,7) + C(n,6) + C(n,5) + C(n,4) + C(n,3) + C(n,2) + C(n,1). +0
1
0, 1, 3, 7, 15, 31, 63, 127, 255, 510, 1012, 1980, 3796, 7098, 12910, 22818, 39202, 65535, 106761, 169765, 263949, 401929, 600369, 880969, 1271625, 1807780, 2533986, 3505698, 4791322, 6474540, 8656936, 11460948, 15033172, 19548045 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n) = A000581(n) + A000580(n) + A000579(n) + A000389(n) + A000332(n) + A000292(n) + A000217(n) + n. a(n) = A000581(n) + A116082(n).

MAPLE

seq(sum(binomial(n, k), k=1..8), n=0..33); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 14 2007

CROSSREFS

Sequence in context: A116082 A043747 A105754 this_sequence A043755 A105755 A043764

Adjacent sequences: A116687 A116688 A116689 this_sequence A116691 A116692 A116693

KEYWORD

easy,nonn

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com), Mar 15 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