The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A110417 For each k from 0 through n-1, take the largest value of C(n,r) that divides k! and sum k! / C(n,r) for all cases where C(n,r)>1. 1
 0, 0, 0, 1, 0, 11, 0, 180, 380, 1627, 0, 379692, 0, 39168360, 19495784, 109797856, 0, 1247559689920, 0, 339677685789414, 39530054317464, 80449141757760, 0, 49078434999009645846, 4049791363412815104, 2006460609738963840 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS a(p) = 0, iff p is a prime. This is a generalization of sequence A110416. LINKS Table of n, a(n) for n=1..26. EXAMPLE a(6) = 3!/(C(6,1)) + 4!/(C(6,1)) + 5!/(C(6,3)) = 1 + 4 + 6 = 11. PROG ;; PLT DrScheme. (Zucker) ;; (! n), (binom n r) have the obvious definitions ;; (min-list a-list) produces 0 if the list is empty. (define (A110417 n) (local ((define (smallest-C-n-r-quotient kfactorial) (min-list (filter integer? (build-list (quotient n 2) (lambda (r) (/ kfactorial (binom n (add1 r))))))))) (apply + (build-list n (lambda (k) (smallest-C-n-r-quotient (! k))))))) CROSSREFS Cf. A110416. Sequence in context: A335646 A261173 A287468 * A240560 A082258 A075361 Adjacent sequences: A110414 A110415 A110416 * A110418 A110419 A110420 KEYWORD easy,nonn AUTHOR Amarnath Murthy, Aug 01 2005 EXTENSIONS Corrected and extended by Joshua Zucker, May 10 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 20 15:37 EDT 2024. Contains 371844 sequences. (Running on oeis4.)