Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147589
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147589 Concatenation of 2n-1 digits 1 and n-1 digits 0. +0
2
1, 1110, 1111100, 1111111000, 1111111110000, 1111111111100000, 1111111111111000000, 1111111111111110000000, 1111111111111111100000000, 1111111111111111111000000000, 1111111111111111111110000000000 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) is also A147590(n) written in base 2.

FORMULA

a(n) = A138118(n)/10.

a(n)={[10^(2*n-1)-1]*10^(n-1)}/9, with n>=1 [From Paolo P. Lava (ppl(AT)spl.at), Nov 26 2008]

EXAMPLE

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

1 ........... 1

2 ......... 1110

3 ....... 1111100

4 ..... 1111111000

5 ... 1111111110000

CROSSREFS

Cf. A138118, A147537, A147590.

Sequence in context: A066163 A036105 A036103 this_sequence A086887 A100846 A072434

Adjacent sequences: A147586 A147587 A147588 this_sequence A147590 A147591 A147592

KEYWORD

easy,nonn

AUTHOR

Omar E. Pol (info(AT)polprimos.com), Nov 08 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 December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research