Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A103448
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A103448 a(n)=sum(mobius(binom(n,k)), k=0..n). +0
3
1, 2, 1, 0, 3, 2, 6, 4, 1, 2, 6, 4, 0, -6, 8, 6, 2, -2, 2, -4, 4, 10, 4, 8, 0, 4, 8, 2, 4, 0, -2, -4, 2, 4, 0, 4, 2, -4, 10, 4, 0, -8, 6, -2, 4, -4, 8, 2, 2, 2, 2, 4, 6, 2, 0, 6, 2, 2, 2, -6, 0, 6, 4, 8, 2, 4, 2, 0, 0, 8, -4, -2, 2, 4, 2, 0, -2, 14, 10, -2, 2, 2, 4, 2, 4, -2, 0, 8, 4, 2, 2, -2, 6, 0, -6, 14, 2, 0, 2, 2, 2, 4, 0, 2, -2 (list; graph; listen)
OFFSET

0,2

COMMENT

Row sums of A103447.

FORMULA

a(n)=sum(mobius(binom(n, k)), k=0..n).

EXAMPLE

a(4)=3 because mobius(1)+mobius(4)+mobius(6)+mobius(4)+mobius(1)=1+0+1+0+1=3.

CROSSREFS

Cf. A103447, A103449.

Sequence in context: A058604 A072661 A103432 this_sequence A078803 A130403 A130402

Adjacent sequences: A103445 A103446 A103447 this_sequence A103449 A103450 A103451

KEYWORD

sign

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 07 2005

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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research