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!)
A109640 Values of n which are incrementally the largest values of the function: Smallest number m such that n divides (10's complement factorial of m). 1

%I #9 Dec 15 2017 17:36:54

%S 1,2,5,11,13,19,23,31,47,97,101,113,131,151,181,227,307,457,907,1009,

%T 1129,1289

%N Values of n which are incrementally the largest values of the function: Smallest number m such that n divides (10's complement factorial of m).

%C These are the indices of records in A109631. - _R. J. Mathar_, Feb 12 2008

%p A089186 := proc(n) 10^max(1,ilog10(n)+1)-n ; end: A110396 := proc(n) mul( A089186(i),i=1..n) ; end: A109631 := proc(n) local a; for a from 1 do if A110396(a) mod n = 0 then RETURN(a) ; fi ; od: end: A109640 := proc(n) option remember ; local nprev,aprev,a ; if n = 1 then RETURN(1); else nprev := A109640(n-1) ; aprev := A109631(nprev) ; for a from nprev+1 do if A109631(a) > aprev then RETURN(a) ; fi ; od; fi ; end: for n from 1 do printf("%d, ",A109640(n)) ; od: # _R. J. Mathar_, Feb 12 2008

%Y Cf. A002034, A110396, A109631, A002034, A110396.

%K more,nonn,base

%O 1,2

%A _Jason Earls_, Aug 04 2005

%E More terms from _R. J. Mathar_, Feb 12 2008

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 April 16 01:01 EDT 2024. Contains 371696 sequences. (Running on oeis4.)