Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007088
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007088 Numbers written in base 2.
(Formerly M4679)
+0
343
0, 1, 10, 11, 100, 101, 110, 111, 1000, 1001, 1010, 1011, 1100, 1101, 1110, 1111, 10000, 10001, 10010, 10011, 10100, 10101, 10110, 10111, 11000, 11001, 11010, 11011, 11100, 11101, 11110, 11111, 100000, 100001, 100010, 100011, 100100, 100101, 100110, 100111 (list; graph; listen)
OFFSET

0,3

COMMENT

Or, numbers that are sums of distinct powers of 10.

Or, decimal numbers that only mention 0 and 1.

Complement of A136399; A064770(a(n)) = a(n). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 30 2007

a(A000290(n)) = A001737(n). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 25 2009]

Contribution from Rick L. Shepherd (rshepherd2(AT)hotmail.com), Jun 25 2009: (Start)

Nonnegative integers with no decimal digit > 1.

Thus nonnegative integers n in base 10 such that kn can be calculated by normal addition (i.e., n + n + ... + n, with k n's (but not necessarily k + k + ... + k, with n k's)) or multiplication without requiring any carry operations for 0 <= k <= 9. (End)

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Franklin T. Adams-Watters, Table of n, a(n) for n = 0..8192

Index entries for sequences related to binary expansion of n

FORMULA

a(n)=Sum{d(i)*10^i: i=0, 1, ..., m}, where Sum{d(i)*2^i: i=0, 1, ..., m} is the base 2 representation of n.

a(n)=(1/2)*sum(i => 0, (1-(-1)^floor(n/2^i))*10^i). - Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 20 2001

a(n) = A097256(n)/9.

a(2n) = 10*a(n), a(2n+1) = a(2n)+1.

G.f. 1/(1-x) * Sum_{k>=0} 10^k * x^{2^k}/(1+x^{2^k}) - for sequence as decimal integers. - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jun 16 2006

EXAMPLE

a(6)=110 because (1/2)*((1-(-1)^6)*10^0+(1-(-1)^3)*10^1+(1-(-1)^1)*10^2) = 10+100

MAPLE

A007088 := proc(n) local dgs ; dgs := convert(n, base, 2) ; add( op(i, dgs)*10^(i-1), i=1..nops(dgs)) ; end: [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 11 2009]

MATHEMATICA

Table[ FromDigits[ IntegerDigits[n, 2]], {n, 0, 39}]

PROGRAM

(PARI) a(n)=subst(Pol(binary(n)), x, 10)

(PARI) a(n)=if(n<=0, 0, n%2+10*a(n\2))

CROSSREFS

The basic sequences concerning the binary expansion of n are this one, A000788, A000069, A001969, A023416, A059015, A000120.

Cf. A000042, A007089, A007090, A007091, A007092, A007093, A007094 & A007095.

Cf. A000695, A005836, A033042-A033052.

A159918. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 25 2009]

Sequence in context: A136830 A153069 A081551 this_sequence A115848 A136814 A136809

Adjacent sequences: A007085 A007086 A007087 this_sequence A007089 A007090 A007091

KEYWORD

nonn,nice,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Robert G. Wilson v (rgwv(AT)rgwv.com)

page 1

Search completed in 0.004 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