|
Search: id:A129227
|
|
|
| A129227 |
|
a(n) = that prime number, p, less than n*pi such that n*pi/p has the smallest fractional part. |
|
+0
2
|
|
| 3, 3, 3, 11, 5, 17, 7, 5, 7, 31, 17, 37, 37, 43, 47, 5, 53, 53, 59, 31, 13, 23, 71, 73, 13, 79, 83, 29, 13, 47, 97, 97, 103, 53, 109, 113, 29, 17, 61, 31, 127, 131, 67, 137, 46, 71, 73, 149, 151, 157, 157, 163, 83, 167, 43, 173, 179, 181, 37, 47, 191, 97, 197, 67, 17, 103
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
a(4)=11 because 4*pi/11 = 1.142... and the fractional part .142... represents the smallest remainder resulting from the division of 4*pi by a prime number less than 4*pi.
|
|
MATHEMATICA
|
f[n_] := (p = Denominator[ Min[ FractionalPart[(n*Pi / Prime@ Range@ PrimePi[n*Pi])]] [[2]]]; If[p == 1, n, p]); Array[f, 66] (* Robert G. Wilson v *)
|
|
CROSSREFS
|
Cf. A129228.
Sequence in context: A097707 A115282 A029616 this_sequence A097161 A101480 A133797
Adjacent sequences: A129224 A129225 A129226 this_sequence A129228 A129229 A129230
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Axel Harvey (ax(AT)hirsig.ca), Apr 04 2007
|
|
EXTENSIONS
|
Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 08 2007
|
|
|
Search completed in 0.002 seconds
|
