The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A053663 Numbers k such that 2*k+1 does not divide k!+1. 2
 1, 2, 4, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 34, 35, 36, 37, 38, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 64, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS G. C. Greubel, Table of n, a(n) for n = 1..10000 MATHEMATICA Select[Range[100], !Divisible[#!+1, 2#+1]&] (* Harvey P. Dale, Sep 09 2014 *) PROG (PARI) isok(n) = (n!+1) % (2*n+1) \\ Michel Marcus, Jul 12 2013 (MAGMA) [n: n in [1..100] | not (Factorial(n)+1) mod (2*n+1) eq 0 ]; // G. C. Greubel, May 18 2019 (Sage) [n for n in (1..100) if not Mod(factorial(n)+1, 2*n+1)==0 ] # G. C. Greubel, May 18 2019 (GAP) Filtered([1..100], n-> not (Factorial(n)+1) mod (2*n+1)=0) # G. C. Greubel, May 18 2019 CROSSREFS Cf. A005097, complement of A053662. Sequence in context: A284958 A014530 A268445 * A324561 A288258 A075313 Adjacent sequences:  A053660 A053661 A053662 * A053664 A053665 A053666 KEYWORD easy,nonn AUTHOR Chris K. Caldwell, Feb 16 2000 EXTENSIONS Data corrected by Michel Marcus, Jul 12 2013 STATUS approved

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

Last modified December 2 08:31 EST 2021. Contains 349437 sequences. (Running on oeis4.)