|
| |
|
|
A110394
|
|
a(1) = 1; a(n) = n times (9's complement of a(n-1)).
|
|
2
| |
|
|
1, 16, 249, 3000, 34995, 390024, 4269825, 45841392, 487427463, 5125725360, 53617021029, 556595747640, 5764255280667, 59300426070648, 610493608940265, 6232102256955744, 64054261631752335, 647023290628457952
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| a(1)=1; a(n)=n*[99...9 - a(n-1)] for n>1 (99...9 and a[n-1] have the same number of digits). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 31 2005
|
|
|
EXAMPLE
| a(4) = 4 times 9's complement of a(3) = 4*(999-249) = 3000.
|
|
|
MAPLE
| s:=proc(m) nops(convert(m, base, 10)) end: a[1]:=1: for n from 2 to 21 do a[n]:=n*(10^s(a[n-1])-1-a[n-1]) od: seq(a[n], n=1..21); (Deutsch)
|
|
|
CROSSREFS
| Sequence in context: A008788 A138460 A183431 * A160446 A158531 A171321
Adjacent sequences: A110391 A110392 A110393 * A110395 A110396 A110397
|
|
|
KEYWORD
| base,easy,nonn
|
|
|
AUTHOR
| Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 29 2005
|
|
|
EXTENSIONS
| More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 31 2005
|
| |
|
|
