Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A138147
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A138147 Concatenation of n digits 1 and n digits 0. +0
3
10, 1100, 111000, 11110000, 1111100000, 111111000000, 11111110000000, 1111111100000000, 111111111000000000, 11111111110000000000, 1111111111100000000000, 111111111111000000000000 (list; graph; listen)
OFFSET

1,1

COMMENT

Also, a(n) = binary representation of A020522(n), for n>0 (See example).

FORMULA

a(n) = (10^(2n) - 10^n)/9 = A002275(n)*10^n. - Omar E. Pol (info(AT)polprimos.com), Apr 16 2008

EXAMPLE

n ... A020522(n) ..... a(n)

1 ....... 2 ........... 10

2 ...... 12 .......... 1100

3 ...... 56 ......... 111000

4 ..... 240 ........ 11110000

5 ..... 992 ....... 1111100000

6 .... 4032 ...... 111111000000

7 ... 16256 ..... 11111110000000

CROSSREFS

Cf. A020522, A138144, A138145, A138720.

Adjacent sequences: A138144 A138145 A138146 this_sequence A138148 A138149 A138150

Sequence in context: A133383 A071672 A122230 this_sequence A036058 A001155 A001391

Cf. A002275.

KEYWORD

easy,nonn

AUTHOR

Omar E. Pol (info(AT)polprimos.com), Mar 29 2008

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research