Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A043545
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A043545 (Maximal base 2 digit of n)-(minimal base 2 digit of n). +0
4
0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; listen)
OFFSET

0,1

FORMULA

0 followed by a string of 2^k - 1 1's. Also a(n)=0 iff n = 2^m - 1.

G.f.: 1/(1-x) - Sum_{k>=0} x^(2^k-1). - Michael Somos, Aug 25 2003

a(n)=(1+(-1)^C(n,floor(n/2)))/2; - Paul Barry (pbarry(AT)wit.ie), Jun 07 2006

Ignoring first zero and beginning instead with offset 2, a(n) = A006530(n) mod 2. - Rick L. Shepherd (rshepherd2(AT)hotmail.com), Jun 09 2008

PROGRAM

(PARI) a(n)=if(n<0, 0, n++; n!=2^valuation(n, 2))

CROSSREFS

Ones-complement of Fredholm-Rueppel sequence A036987.

Sequence in context: A163539 A143538 A011656 this_sequence A094754 A074290 A091225

Adjacent sequences: A043542 A043543 A043544 this_sequence A043546 A043547 A043548

KEYWORD

nonn,base

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research