login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063010 Carryless binary square of n; also Moser-de Bruijn sequence written in binary. 3
0, 1, 100, 101, 10000, 10001, 10100, 10101, 1000000, 1000001, 1000100, 1000101, 1010000, 1010001, 1010100, 1010101, 100000000, 100000001, 100000100, 100000101, 100010000, 100010001, 100010100, 100010101, 101000000, 101000001 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Numbers that are sums of distinct powers of 100. - David Wasserman (dwasserm(AT)earthlink.net), Feb 26 2008

LINKS

David Applegate, Marc LeBrun and N. J. A. Sloane, Carryless Arithmetic (I): The Mod 10 Version

FORMULA

a(n)=A062033(n)/10 i.e. with final zero removed.

a(n)=Sum_k>=0 {A030308(n,k)*A098608(k)}. - From DELEHAM Philippe, Oct 15 2011.

EXAMPLE

a(11)=1000101, since 11 in binary is 1011 and binary carryless sum of 1011000, 0, 10110 and 1011 is 1000101.

CROSSREFS

Cf. Moser-de Bruijn sequence A000695, carryless decimal squares A059729, pre-carry binary squares A063009.

Sequence in context: A091254 A085251 A178530 * A094027 A092633 A108343

Adjacent sequences:  A063007 A063008 A063009 * A063011 A063012 A063013

KEYWORD

base,nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Jul 03 2001

EXTENSIONS

More terms from David Wasserman (dwasserm(AT)earthlink.net), Feb 26 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 18:47 EST 2012. Contains 205663 sequences.