|
| |
|
|
A110346
|
|
Largest multiple of n in n + (n-1) +(n-2) + ... (n-k).
|
|
1
| |
|
|
1, 2, 6, 4, 15, 18, 28, 8, 45, 40, 66, 72, 91, 84, 120, 16, 153, 126, 190, 200, 231, 198, 276, 264, 325, 260, 378, 196, 435, 450, 496, 32, 561, 442, 630, 288, 703, 570, 780, 520, 861, 882, 946, 924, 1035, 828, 1128, 1056, 1225, 950, 1326, 1300, 1431, 1134, 1540
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
FORMULA
| a(2n-1) = n(2n-1).
|
|
|
PROG
| ;; PLT DrScheme (Zucker)
(define (A110346 n)
(apply max (filter (lambda (x) (= 0 (remainder x n)))
(build-list n (lambda (k) (apply + (build-list (add1 k) (lambda (j) (- n j)))))))))
;; yes, it would be faster to use n(n+1)/2 - k(k+1)/2 instead of summing.
|
|
|
CROSSREFS
| Sequence in context: A069914 A200746 A130190 * A095754 A181159 A127320
Adjacent sequences: A110343 A110344 A110345 * A110347 A110348 A110349
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 20 2005
|
|
|
EXTENSIONS
| More terms from Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), May 09 2006
|
| |
|
|
