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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038619 Smallest number that needs more lines when shown in a digital clock than any previous term. 0
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; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..31.

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: A296387 A302658 A084909 * A118257 A066762 A066198

Adjacent sequences:  A038616 A038617 A038618 * A038620 A038621 A038622

KEYWORD

nonn,base,easy,nice

AUTHOR

Jan Kristian Haugland (jankrihau(AT)hotmail.com)

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 22 12:13 EST 2019. Contains 319363 sequences. (Running on oeis4.)