|
| |
|
|
A105279
|
|
a(0)=0; a(n) = 10*a(n-1) + 10.
|
|
1
| |
|
|
0, 10, 110, 1110, 11110, 111110, 1111110, 11111110, 111111110, 1111111110, 11111111110, 111111111110, 1111111111110, 11111111111110, 111111111111110, 1111111111111110
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| a(n) is the smallest even number with digits in {0,1} having digit sum n; in other words, the base 10 reading of the binary string of A000918(n). Cf. A069532. - Jason Kimberley, Nov 02 2011
|
|
|
LINKS
| Vincenzo Librandi, Table of n, a(n) for n = 0..100
|
|
|
FORMULA
| a(n) = (10/9)*(10^n-1), with n>=0
a(n) = sum(k=1,n, 10^k ).
Repunits times 10: a(n) = 10 * A002275(n). [Reinhard Zumkeller, Feb 05 2012]
|
|
|
PROG
| (MAGMA) [-10/9+(10/9)*10^n: n in [0..20]]; // Vincenzo Librandi, Jul 04 2011
(Haskell)
a105279 n = a105279_list !! n
a105279_list = iterate ((* 10) . (+ 1)) 0
-- Reinhard Zumkeller, Feb 05 2012
|
|
|
CROSSREFS
| Cf. A052386, A052379, A069532, A080674, A029858, A000918.
Sequence in context: A144099 A102092 A189788 * A057093 A055276 A143749
Adjacent sequences: A105276 A105277 A105278 * A105280 A105281 A105282
|
|
|
KEYWORD
| nonn,easy,changed
|
|
|
AUTHOR
| Alexandre Wajnberg (alexandre.wajnberg(AT)ulb.ac.be), Apr 25 2005
|
| |
|
|
