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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080446 a(1) = 2, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1). 8

%I

%S 2,12,108,1188,10692,117612,1058508,11643588,104792292,1152715212,

%T 10374436908,114118805988,1027069253892,11297761792812,

%U 101679856135308,1118478417488388,10066305757395492,110729363331350412

%N a(1) = 2, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1).

%C Assuming a(2)=12: Same as A080447 from n=2 on, since the author appears to discard any term divisible by 10: 10=5*a(1). - Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 06 2003

%Y Cf. A080445, A080447, A080448, A080449, A080450, A080451, A080452, A080453.

%K base,nonn

%O 1,1

%A _Amarnath Murthy_, Feb 23 2003

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

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 17 08:57 EDT 2019. Contains 327128 sequences. (Running on oeis4.)