login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052216 Sum of two powers of 10. 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, 10010000, 10100000 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Numbers n such that sum of digits is 2.

FORMULA

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

MATHEMATICA

t = 10^Range[0, 9]; Select[Union[Flatten[Table[i + j, {i, t}, {j, t}]]], # <= t[[-1]] + 1 &] (* T. D. Noe, Oct 09 2011 *)

With[{nn=7}, Sort[Join[Table[FromDigits[PadRight[{2}, n, 0]], {n, nn}], FromDigits/@Flatten[Table[Table[Insert[PadRight[{1}, n, 0], 1, i]], {n, nn}, {i, 2, n+1}], 1]]]] (* From Harvey P. Dale, Nov 15 2011 *)

CROSSREFS

Cf. A007953.

Sequence in context: A064975 A115095 A061907 * A094629 A081242 A071762

Adjacent sequences:  A052213 A052214 A052215 * A052217 A052218 A052219

KEYWORD

easy,nonn,tabl

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 16:43 EST 2012. Contains 205635 sequences.