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”).

A117294
Number of sequences of length n starting with 1,2 which satisfy a recurrence a(k+1) = floor(c*a(k)) for some constant c.
1
1, 2, 5, 14, 37, 102, 279, 756, 2070, 5609, 15198, 41530, 114049, 315447, 876513, 2446326, 6861432, 19315953, 54556553
OFFSET
2,2
COMMENTS
It appears that a(n+1)/a(n) may be converging slowly to 3, but even that it converges is not obvious.
EXAMPLE
a(4) = 5; length 4 sequences are 1,2,4,8; 1,2,4,9; 1,2,5,12; 1,2,5,13; and 1,2,5,14.
PROG
(define (A117294 n) (local ((define (get-ratios seq add?) (cond [(empty? (rest seq)) empty] [else (cons (/ (cond [add? (add1 (first seq))] [else (first seq)]) (second seq)) (get-ratios (rest seq) add?))])) (define (extend-one seq) (local ((define startnext (floor (* (apply max (get-ratios seq false)) (first seq)))) (define endnext (ceiling (* (apply min (get-ratios seq true )) (first seq)))) (define ltodo (build-list (- endnext startnext) (lambda (n) (cons (+ startnext n) seq))))) (cond [(>= (length seq) (sub1 n)) (length ltodo)] [else (apply + (map extend-one ltodo))])))) (extend-one (list 2 1)))) - Joshua Zucker, Jun 05 2006
CROSSREFS
Some (infinite) examples of such sequences: A000079, A007051, A076883, A001519, A024537, A024576, A057960.
Sequence in context: A077938 A077987 A143141 * A148306 A148307 A148308
KEYWORD
more,nonn
AUTHOR
EXTENSIONS
More terms from Joshua Zucker, Jun 05 2006
Comment edited by Franklin T. Adams-Watters, May 14 2010
Ambiguous terms a(0), a(1) removed by Max Alekseyev, Jan 18 2012
STATUS
approved