Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A112891
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A112891 a(n) is the least positive integer in base 10 containing n ones that is divisible by n. +0
2
1, 110, 111, 11112, 111110, 1111110, 11101111, 111111112, 111111111, 11111111110, 111111111111, 1111111111116, 11111111111113, 111111111111112, 1111111111111110, 111111111111110112, 111101111111111111 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n) = n*A112892(n).

EXAMPLE

a(4) = 11112 because 11112 contains 4 ones and is divisible by 4.

CROSSREFS

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

Sequence in context: A008944 A106004 A113556 this_sequence A036230 A135642 A166323

Adjacent sequences: A112888 A112889 A112890 this_sequence A112892 A112893 A112894

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research