Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A112907
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A112907 a(n) is the least positive integer containing n eights that is divisible by n. +0
20
8, 88, 888, 8888, 888880, 888888, 28888888, 88888888, 888888888, 88888888880, 888888888888, 888888888888, 78888888888888, 588888888888888, 8888888888888880, 88888888888881888, 688888888888888888 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n) = n*A112908(n).

EXAMPLE

a(7) = 28888888 because 28888888 contains 7 eights and is divisible by 7.

CROSSREFS

Cf. A112889-A112898, A112900-A112905, A112908-A112910.

Sequence in context: A062185 A053379 A002282 this_sequence A053380 A115864 A036917

Adjacent sequences: A112904 A112905 A112906 this_sequence A112908 A112909 A112910

KEYWORD

base,nonn

AUTHOR

Ray G. Opao (1260(AT)email.com), Oct 05 2005

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 09 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research