|
Search: id:A087743
|
|
|
| A087743 |
|
Numbers n >= 3 with property that the remainder when n is divided by k (for 3 <= k <= n-2) is not 1. |
|
+0
1
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
More generally, let prime_Y consist of the numbers n >= 2+Y which never yield a remainder of Y when divided by any number from 2+Y to n-Y-1. Prime_0 are the usual primes, A000040. This sequence gives prime_2.
|
|
FORMULA
|
P[n, Y] = P[n-1, Y] for most terms where P is a Boolean array of numbers n and Y their order of primeness: if P[n, Y] then n is a prime of order Y
|
|
CROSSREFS
|
Sequence in context: A047426 A026487 A130788 this_sequence A073568 A094576 A103103
Adjacent sequences: A087740 A087741 A087742 this_sequence A087744 A087745 A087746
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Chas A Guderjahn (chasag(AT)aol.com), Oct 01 2003
|
|
|
Search completed in 0.002 seconds
|
