|
Search: id:A111701
|
|
|
| A111701 |
|
Least integer obtained when n is divided by prime(1), then by prime(2), then by prime(3),..., stopping as soon as one of the primes does not divide it. In particular, a(2n-1) = 2n-1. |
|
+0
4
|
|
| 1, 1, 3, 2, 5, 1, 7, 4, 9, 5, 11, 2, 13, 7, 15, 8, 17, 3, 19, 10, 21, 11, 23, 4, 25, 13, 27, 14, 29, 1, 31, 16, 33, 17, 35, 6, 37, 19, 39, 20, 41, 7, 43, 22, 45, 23, 47, 8, 49, 25, 51, 26, 53, 9, 55, 28, 57, 29, 59, 2, 61, 31, 63, 32, 65, 11, 67, 34, 69, 35, 71, 12, 73, 37, 75, 38, 77
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
n divided by the largest primorial that divides it.
|
|
MATHEMATICA
|
f[n_] := Block[{m = n, k = 1}, While[ IntegerQ[ m/Prime[k]], m = m/Prime[k]; k++ ]; m]; Table[ f[n], {n, 77}] (* Robert G. Wilson v *)
|
|
CROSSREFS
|
Cf. A114562.
Sequence in context: A051543 A129538 A076934 this_sequence A093527 A088233 A056008
Adjacent sequences: A111698 A111699 A111700 this_sequence A111702 A111703 A111704
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 21 2005
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(at)rgwv.com), Aug 25 2005
|
|
|
Search completed in 0.005 seconds
|
