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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080451 a(1) = 7, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1). 9
7, 14, 112, 1008, 11088, 121968, 1097712, 12074832, 108673488, 1195408368, 10758675312, 118345428432, 1065108855888, 11716197414768, 105445776732912, 1159903544062032, 10439131896558288, 114830450862141168 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Harvey P. Dale, Table of n, a(n) for n = 1..1000

MATHEMATICA

nxt[n_]:=Module[{k=2, len=IntegerLength[n]+1}, While[IntegerLength[ k*n]<len || Divisible[k*n, 10], k++]; k*n] (* Harvey P. Dale, Jan 20 2015 *)

CROSSREFS

Cf. A080445, A080446, A080447, A080448, A080449, A080450, A080452, A080453.

Sequence in context: A196254 A173167 A143682 * A061522 A213151 A225763

Adjacent sequences:  A080448 A080449 A080450 * A080452 A080453 A080454

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy, Feb 23 2003

EXTENSIONS

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 06 2003

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 September 19 23:31 EDT 2019. Contains 327207 sequences. (Running on oeis4.)