Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101691
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101691 A modular binomial sum sequence. +0
1
1, 1, 2, 1, 3, 1, 2, 2, 5, 1, 2, 2, 4, 2, 4, 4, 9, 1, 2, 2, 4, 2, 4, 4, 8, 2, 4, 4, 8, 4, 8, 8, 17, 1, 2, 2, 4, 2, 4, 4, 8, 2, 4, 4, 8, 4, 8, 8, 16, 2, 4, 4, 8, 4, 8, 8, 16, 4, 8, 8, 16, 8, 16, 16, 33, 1, 2, 2, 4, 2, 4, 4, 8, 2, 4, 4, 8, 4, 8, 8, 16, 2, 4, 4, 8, 4, 8, 8, 16, 4, 8, 8 (list; graph; listen)
OFFSET

0,3

COMMENT

a(2^n)=A094373(n). a(2^n-1)=1,1,1,2,4,8,16,...

FORMULA

a(n)=sum{k=0..n, mod(binomial(2n-2, k), 2)}

CROSSREFS

Cf. A048896.

Sequence in context: A037269 A124579 A035306 this_sequence A070094 A105497 A132662

Adjacent sequences: A101688 A101689 A101690 this_sequence A101692 A101693 A101694

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Dec 11 2004

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 9 14:43 EST 2009. Contains 170430 sequences.


AT&T Labs Research