|
Search: id:A094302
|
|
|
| A094302 |
|
a(1) = 1; if n > a(n-1) then a(n) = n*a(n-1) else a(n) = least integer multiple of a(n-1)/n. |
|
+0
4
|
|
| 1, 2, 6, 3, 15, 5, 35, 35, 35, 7, 77, 77, 77, 11, 165, 165, 165, 55, 55, 11, 231, 21, 483, 161, 161, 161, 161, 23, 667, 667, 667, 667, 667, 667, 667, 667, 667, 667, 667, 667, 667, 667, 667, 667, 667, 29, 1363, 1363, 1363, 1363, 1363, 1363, 1363, 1363, 1363, 1363
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
a(16) = 165, 17 < 165, so a(17) = (least integer multiple of 165/17) = 165.
|
|
PROGRAM
|
(PARI) q=1; for(n=2, 57, print1(q, ", "); q=if(n>q, q*n, q/gcd(q, n)))
|
|
CROSSREFS
|
Cf. A094299, A055773.
Sequence in context: A072647 A100113 A094426 this_sequence A094300 A055773 A111866
Adjacent sequences: A094299 A094300 A094301 this_sequence A094303 A094304 A094305
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 29 2004
|
|
EXTENSIONS
|
Edited by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), May 02 2004
|
|
|
Search completed in 0.002 seconds
|
