OFFSET
2,1
LINKS
Antti Karttunen, Table of n, a(n) for n = 2..10000
FORMULA
MATHEMATICA
p[n_, k_]=n!/Product[i, {i, n-Floor[2*n/3^k], n-Floor[n/3^k]}]
f[n_]=Sum[Floor[p[n, k]/p[n-1, k]], {k, 1, 8}]
at=Table[f[n], {n, 2, 200}]
PROG
(PARI)
A088488(n) = sum(k=1, 8, (A254876bi(n, k)\A254876bi(n-1, k)));
A254876bi(n, k) = n! / prod(i=(n-((2*n)\(3^k))), (n-(n\(3^k))), i);
for(n=2, 10000, write("b088488.txt", n, " ", A088488(n)));
(Scheme)
(define (A088488 n) (add (lambda (k) (floor->exact (/ (A254876bi n k) (A254876bi (- n 1) k)))) 1 8))
;; The following function implements sum_{i=lowlim..uplim} intfun(i)
(define (add intfun lowlim uplim) (let sumloop ((i lowlim) (res 0)) (cond ((> i uplim) res) (else (sumloop (1+ i) (+ res (intfun i)))))))
CROSSREFS
KEYWORD
nonn,less
AUTHOR
Roger L. Bagula, Nov 09 2003
EXTENSIONS
Edited by Antti Karttunen, Feb 09 2015
STATUS
approved