login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087393 a(1) = 1, a(n) = smallest number beginning with a(n-1) == 0 (mod n!). 0

%I

%S 1,10,102,10200,10200,10200240,102002402880,1020024028800,

%T 102002402880080640,1020024028800806400,102002402880080640029030400,

%U 102002402880080640029030400159667200

%N a(1) = 1, a(n) = smallest number beginning with a(n-1) == 0 (mod n!).

%e a(3) = 102, a(4) = 10200 that begins with the digits 102 and 10200 = 24*425, as 10200= 120*85, one has a(5) = 10200.

%K base,nonn

%O 1,2

%A _Amarnath Murthy_, Sep 10 2003

%E More terms from _David Wasserman_, May 31 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 26 22:13 EST 2023. Contains 359836 sequences. (Running on oeis4.)