|
Search: id:A109640
|
|
|
| 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). |
|
+0
1
|
|
| 1, 2, 5, 11, 13, 19, 23, 31, 47, 97, 101, 113, 131, 151, 181, 227, 307, 457, 907, 1009, 1129, 1289
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
These are the indices of records in A109631. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 12 2008
|
|
MAPLE
|
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 (mathar(AT)strw.leidenuniv.nl), Feb 12 2008
|
|
CROSSREFS
|
Cf. A002034, A110396.
Cf. A109631, A002034, A110396.
Sequence in context: A045360 A001915 A084792 this_sequence A105961 A045361 A086081
Adjacent sequences: A109637 A109638 A109639 this_sequence A109641 A109642 A109643
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Aug 04 2005
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 12 2008
|
|
|
Search completed in 0.002 seconds
|
