The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A090490 For n > 1, a(n) is the least multiple of n that can be obtained by adding one digit to each end of a(n-1). 0

%I

%S 1,110,11100,1111000,111110000,11111100000,1111111000006,

%T 111111110000064,11111111100000648,1111111111000006480,

%U 111111111110000064800,11111111111100000648000,1111111111111000006480005,111111111111110000064800052,11111111111111100000648000525

%N For n > 1, a(n) is the least multiple of n that can be obtained by adding one digit to each end of a(n-1).

%C Sequence has 15 terms. No multiple of 16 can be obtained in this way from a(15). - _David Wasserman_, Dec 06 2005

%e a(8) = 111111110000064 is a multiple of 8 and is the concatenation of 1, a(7) and 4.

%Y Cf. A078282.

%K base,nonn,easy,fini,full

%O 1,2

%A _Amarnath Murthy_, Dec 03 2003

%E More terms from _David Wasserman_, Dec 06 2005

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.

Last modified September 27 02:21 EDT 2021. Contains 347673 sequences. (Running on oeis4.)