login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A088487
a(n) = Sum_{k=1..8} floor(A254864(n,k)/A254864(n-1,k)), where A254864(n,k) = n! / (n-floor(n/3^k))!.
5
8, 10, 8, 8, 13, 8, 8, 24, 8, 8, 19, 8, 8, 22, 8, 8, 42, 8, 8, 28, 8, 8, 31, 8, 8, 86, 8, 8, 37, 8, 8, 40, 8, 8, 78, 8, 8, 46, 8, 8, 49, 8, 8, 96, 8, 8, 55, 8, 8, 58, 8, 8, 167, 8, 8, 64, 8, 8, 67, 8, 8, 132, 8, 8, 73, 8, 8, 76, 8, 8, 150, 8, 8, 82, 8, 8, 85, 8, 8, 328, 8, 8, 91, 8, 8, 94, 8, 8
OFFSET
2,1
LINKS
FORMULA
a(n) = Sum_{k=1..8} floor(A254864(n,k)/A254864(n-1,k)), where A254864(n,k) = n! / (n-floor(n/3^k))!.
MATHEMATICA
p[n_, k_]=n!/Product[i, {i, 1, n-Floor[n/3^k]}] digits=200 f[n_]=Sum[Floor[p[n, k]/p[n-1, k]], {k, 1, 8}] at=Table[f[n], {n, 2, digits}]
PROG
(PARI)
A254864bi(n, k) = prod(i=(1+(n-(n\(3^k)))), n, i);
A088487(n) = sum(k=1, 8, (A254864bi(n, k)\A254864bi(n-1, k)));
for(n=2, 10000, write("b088487.txt", n, " ", A088487(n)));
(Scheme)
(define (A088487 n) (add (lambda (k) (floor->exact (/ (A254864bi n k) (A254864bi (- n 1) k)))) 1 8)) ;; Code for A254864bi given in A254864.
;; 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
Sequence in context: A105021 A343212 A273651 * A010733 A365790 A066004
KEYWORD
nonn,less
AUTHOR
Roger L. Bagula, Nov 09 2003
EXTENSIONS
Edited by Antti Karttunen, Feb 09 2015
STATUS
approved