|
Search: id:A093411
|
|
|
| A093411 |
|
Divide n by the largest factorial that divides it and repeat until an odd number is reached. |
|
+0
2
|
|
| 0, 1, 1, 3, 1, 5, 1, 7, 1, 9, 5, 11, 1, 13, 7, 15, 1, 17, 3, 19, 5, 21, 11, 23, 1, 25, 13, 27, 7, 29, 5, 31, 1, 33, 17, 35, 1, 37, 19, 39, 5, 41, 7, 43, 11, 45, 23, 47, 1, 49, 25, 51, 13, 53, 9, 55, 7, 57, 29, 59, 5, 61, 31, 63, 1, 65, 11, 67, 17, 69, 35, 71, 3, 73, 37, 75, 19, 77, 13, 79
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
a(n) is odd for all positive n>0; a(n)=n iff n is odd.
|
|
EXAMPLE
|
a(18) = 3, 18/6 = 3. though 18/2 = 9.
|
|
MATHEMATICA
|
f[n_] := Block[{m = n, k = n}, While[k > 1, While[ IntegerQ[m/k! ], m = m/k! ]; k-- ]; m]; Table[ f[n], {n, 0, 79}] (* Robert G. Wilson v *)
|
|
CROSSREFS
|
For bisection see A109375.
Sequence in context: A155457 A009001 A093178 this_sequence A147088 A118402 A122383
Adjacent sequences: A093408 A093409 A093410 this_sequence A093412 A093413 A093414
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 30 2004
|
|
EXTENSIONS
|
Edited, corrected and extended by Robert G. Wilson v (rgwv(at)rgwv.com), Aug 25 2005
|
|
|
Search completed in 0.002 seconds
|
