cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A109640 Indices of records in A109631.

Original entry on oeis.org

1, 2, 5, 11, 13, 19, 23, 31, 47, 97, 101, 113, 131, 151, 181, 227, 307, 457, 907, 1009, 1129, 1289, 1511, 1801, 2251, 3001, 4507, 9001, 10007, 11251, 12889, 15013, 18013, 22501, 30011, 45007, 90001, 100003, 112501, 128591, 150001, 180001, 225023, 300007, 450001
Offset: 1

Views

Author

Jason Earls, Aug 04 2005

Keywords

Comments

Previous name was: Values of k which are incrementally the largest values of the function: Smallest number m such that k divides (10's complement factorial of m).

Crossrefs

Programs

  • 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, Feb 12 2008

Extensions

More terms from R. J. Mathar, Feb 12 2008
a(23)-a(45) from Jinyuan Wang, Aug 09 2025
New name (using comment from R. J. Mathar) from Joerg Arndt, Aug 09 2025