Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A163664
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A163664 a(n) = 10^n + 10^(2n). +0
5
110, 10100, 1001000, 100010000, 10000100000, 1000001000000, 100000010000000, 10000000100000000, 1000000001000000000, 100000000010000000000, 10000000000100000000000, 1000000000001000000000000, 100000000000010000000000000, 10000000000000100000000000000 (list; graph; listen)
OFFSET

1,1

COMMENT

A161168(n) or A063376(n) for n >= 1 written in base 2.

The digits from the left to the right: a 1, (n-1) times 0, a 1, and n times 0.

FORMULA

a(n)=110*a(n-1)-1000*a(n-2) = 10*A163449(n). G.f.: -10*x*(-11+200*x)/((100*x-1)*(10*x-1)).

CROSSREFS

Sequence in context: A111784 A146495 A063751 this_sequence A135645 A058935 A109241

Adjacent sequences: A163661 A163662 A163663 this_sequence A163665 A163666 A163667

KEYWORD

nonn,base,easy

AUTHOR

Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Aug 02 2009

EXTENSIONS

Edited by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 06 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