|
|
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
|
|
|
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.
(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
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|