login

Revision History for A327408

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Smallest integer > 0 so that its remainders modulo the first n primes are less than half their respective moduli.
(history; published version)
#12 by Joerg Arndt at Sun Sep 08 04:35:37 EDT 2019
STATUS

proposed

approved

#11 by Michel Marcus at Sun Sep 08 03:35:04 EDT 2019
STATUS

editing

proposed

#10 by Michel Marcus at Sun Sep 08 03:34:59 EDT 2019
PROG

(PARI) isok(k, vp) = {for (i=1, #vp, if ((k % vp[i]) >= vp[i]/2, return (0)); ); return (1); }

a(n) = {my(k=1, vp = primes(n)); while (!isok(k, vp), k++); k; } \\ Michel Marcus, Sep 08 2019

STATUS

approved

editing

#9 by Joerg Arndt at Sun Sep 08 02:05:10 EDT 2019
STATUS

proposed

approved

#8 by Bert Dobbelaere at Sun Sep 08 01:55:08 EDT 2019
STATUS

editing

proposed

#7 by Bert Dobbelaere at Sun Sep 08 01:54:53 EDT 2019
LINKS

Bert Dobbelaere, <a href="/A327408/b327408.txt">Table of n, a(n) for n = 1..53</a>

STATUS

approved

editing

#6 by Sean A. Irvine at Sat Sep 07 19:19:04 EDT 2019
STATUS

reviewed

approved

#5 by Joerg Arndt at Sat Sep 07 08:13:04 EDT 2019
STATUS

proposed

reviewed

Discussion
Sat Sep 07
08:53
Michel Marcus: I don't quite understand the piece "are less than half their respective moduli"
10:25
Bert Dobbelaere: Would "are all less than half their modulus" be any clearer ?
#4 by Bert Dobbelaere at Sat Sep 07 05:40:50 EDT 2019
STATUS

editing

proposed

#3 by Bert Dobbelaere at Sat Sep 07 05:34:42 EDT 2019
NAME

allocated for Bert DobbelaereSmallest integer > 0 so that its remainders modulo the first n primes are less than half their respective moduli.

DATA

2, 4, 6, 10, 16, 16, 70, 136, 210, 210, 442, 786, 786, 786, 6450, 53110, 53110, 247690, 303810, 303810, 813450, 3443146, 5889382, 9327220, 10068256, 63916062, 63916062, 63916062, 285847290, 285847290, 285847290, 285847290, 370793956, 370793956, 370793956, 370793956

OFFSET

1,1

EXAMPLE

a(6) = 16.

16 mod 2 = 0 < 2/2

16 mod 3 = 1 < 3/2

16 mod 5 = 1 < 5/2

16 mod 7 = 2 < 7/2

16 mod 11 = 5 < 11/2

16 mod 13 = 3 < 13/2

16 is the smallest integer > 0 satisfying these inequalities for the first 6 primes.

CROSSREFS

Companion sequence of A327409.

Cf. A002110, A306582, A306612.

KEYWORD

allocated

nonn

AUTHOR

Bert Dobbelaere, Sep 07 2019

STATUS

approved

editing