Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105229
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105229 Sum_{k=0..n} (1-(-1)^( floor( (-n-k)/2^k ) )) * 2^(k-1). +0
3
0, 3, 4, 9, 26, 59, 112, 245, 502, 1015, 2036, 4081, 8178, 16355, 32744, 65517, 131054, 262127, 524268, 1048553, 2097130, 4194283, 8388576, 16777189, 33554406, 67108839, 134217700, 268435425, 536870850, 1073741779, 2147483608, 4294967261, 8589934558 (list; graph; listen)
OFFSET

0,2

REFERENCES

David Applegate, Benoit Cloitre, Philippe DELEHAM and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers, J. Integer Seq. 8 (2005), no. 3, Article 05.3.6, 15 pp.

LINKS

David Applegate, Benoit Cloitre, Philippe DELEHAM and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers [pdf, ps].

FORMULA

a(n) + A105228(n) = 2^(n+1) for n > 0.

MAPLE

A105229 :=proc(n) add( (1-(-1)^( floor( (-n-k)/2^k ) )) * 2^(k-1), k=0..n); end;

CROSSREFS

Sequence in context: A034921 A038222 A038629 this_sequence A080849 A058857 A084715

Adjacent sequences: A105226 A105227 A105228 this_sequence A105230 A105231 A105232

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Apr 15 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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research