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!)
A070294 Smallest k such that k==i (mod(i!+1)) i=1,2,3,...,n. 0
1, 5, 17, 479, 71879 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
There are no more terms. Any subsequent term would need to satisfy both k = 3 mod 7 and k = 6 mod 721 (6!+1). But, since 721 = 7*103, that implies that the next term would have to equal 3 mod 721 and 6 mod 721. - Larry Reeves (larryr(AT)acm.org), Sep 27 2002
LINKS
PROG
(PARI) for(n=1, 5, m=1; while(sum(i=1, n, abs(m%(1+i!)-i))>0, m++); print1(m, ", "))
CROSSREFS
Cf. A053664.
Sequence in context: A318751 A096996 A256236 * A245568 A218378 A119531
KEYWORD
easy,nonn,fini,full
AUTHOR
Benoit Cloitre, May 12 2002
STATUS
approved

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 20 09:04 EDT 2024. Contains 371799 sequences. (Running on oeis4.)