Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A163450
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A163450 A028403(n) written in base 2. +0
2
100, 1100, 101000, 10010000, 1000100000, 100001000000, 10000010000000, 1000000100000000, 100000001000000000, 10000000010000000000, 1000000000100000000000, 100000000001000000000000, 10000000000010000000000000, 1000000000000100000000000000 (list; graph; listen)
OFFSET

1,1

COMMENT

The digit pattern is (for n>1): one 1, (n-2) times 0, one 1, and n times 0.

FORMULA

a(n) = 10^(2n-1) + 10^n, for n >= 2.

a(n) = 110*a(n-1) -1000*a(n-2), n>3.

CROSSREFS

Sequence in context: A025421 A124166 A103175 this_sequence A129725 A167043 A114777

Adjacent sequences: A163447 A163448 A163449 this_sequence A163451 A163452 A163453

KEYWORD

nonn,easy,base

AUTHOR

Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Jul 27 2009

EXTENSIONS

Reccurence added by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 21 2009

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 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research