Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052216
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A052216 Numbers n such that sum of digits is 2. +0
12
2, 11, 20, 101, 110, 200, 1001, 1010, 1100, 2000, 10001, 10010, 10100, 11000, 20000, 100001, 100010, 100100, 101000, 110000, 200000, 1000001, 1000010, 1000100, 1001000, 1010000, 1100000, 2000000, 10000001, 10000010, 10000100, 10001000 (list; graph; listen)
OFFSET

1,1

FORMULA

Sum of two powers of 10: a(n) = 10^n + 10^m, n >= 0, m = 0, ... n.

CROSSREFS

Cf. A007953.

Sequence in context: A064975 A115095 A061907 this_sequence A094629 A081242 A071762

Adjacent sequences: A052213 A052214 A052215 this_sequence A052217 A052218 A052219

KEYWORD

base,easy,nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Feb 01 2000

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research