|
Search: id:A038619
|
|
|
| A038619 |
|
Smallest number that needs more lines when shown in a digital clock than any previous term. |
|
+0
1
|
|
| 1, 2, 6, 8, 10, 18, 20, 28, 68, 88, 108, 188, 200, 208, 288, 688, 888, 1088, 1888, 2008, 2088, 2888, 6888, 8888, 10888, 18888, 20088, 20888, 28888, 68888, 88888, 108888
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
FORMULA
|
For n >= 3, the terms with n digits are given by: 108A + B, 188A + B, 200A + B, 208A + B, 288A + B, 688A + B, 888A + B where A = 10^(n - 3), B = 8 (A - 1) / 9.
|
|
EXAMPLE
|
0, 1, 2, ..., 9 need 6, 2, 5, 5, 4, 5, 6, 3, 7, 6 lines
|
|
CROSSREFS
|
Sequence in context: A036554 A095736 A084909 this_sequence A118257 A066762 A066198
Adjacent sequences: A038616 A038617 A038618 this_sequence A038620 A038621 A038622
|
|
KEYWORD
|
nonn,base,easy,nice
|
|
AUTHOR
|
Jan Kristian Haugland (jankrihau(AT)hotmail.com)
|
|
|
Search completed in 0.002 seconds
|
