|
| |
|
|
A248596
|
|
Smallest prime number R such that there is a prime number Q with floor(Q/R) = prime(n).
|
|
3
|
|
|
|
2, 2, 2, 3, 2, 3, 3, 3, 2, 2, 5, 3, 2, 3, 5, 2, 3, 5, 5, 5, 5, 3, 2, 2, 3, 5, 3, 7, 5, 2, 3, 2, 11, 3, 3, 5, 5, 3, 3, 2, 2, 5, 2, 5, 3, 3, 7, 5, 3, 7, 2, 2, 7, 2, 3, 5, 3, 7, 11, 2, 7, 2, 7, 5, 3, 3, 5, 3, 11, 3, 3, 2, 3, 5, 7, 3, 5, 3, 11, 3, 2, 7, 2, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
Prime numbers Q are in A248595.
|
|
|
LINKS
|
Pierre CAMI, Table of n, a(n) for n = 1..10000
|
|
|
MATHEMATICA
|
a[n_] := For[p = Prime[n]; r = 2, True, r = NextPrime[r], For[q = NextPrime[r*p, -1], q <= (p + 1) r, q = NextPrime[q], If[Floor[q/r] == p, Return[r]]]]; Array[a, 100] (* Jean-François Alcover, Oct 26 2014 *)
|
|
|
PROG
|
See A248595 for Excel & Visual Basic program.
|
|
|
CROSSREFS
|
Cf. A248595.
Sequence in context: A239428 A257497 A266225 * A076984 A079085 A076869
Adjacent sequences: A248593 A248594 A248595 * A248597 A248598 A248599
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Pierre CAMI, Oct 09 2014
|
|
|
STATUS
|
approved
|
| |
|
|
