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

A121663
a(0) = 1; if n = 2^k, a(n) = k+2, otherwise a(n)=(A000523(n)+2)*a(A053645(n)).
6
1, 2, 3, 6, 4, 8, 12, 24, 5, 10, 15, 30, 20, 40, 60, 120, 6, 12, 18, 36, 24, 48, 72, 144, 30, 60, 90, 180, 120, 240, 360, 720, 7, 14, 21, 42, 28, 56, 84, 168, 35, 70, 105, 210, 140, 280, 420, 840, 42, 84, 126, 252, 168, 336, 504, 1008, 210, 420, 630, 1260, 840, 1680
OFFSET
0,2
COMMENTS
Each n occurs A045778(n) times in the sequence.
LINKS
FORMULA
G.f.: Product_{k>=0} (1 + (k + 2) * x^(2^k)). - Ilya Gutkovskiy, Aug 19 2019
MATHEMATICA
f[0] := 1; f[n_] := If[(b = n - 2^(k = Floor[Log2[n]])) == 0, k + 2, (k + 2)*f[b]]; Table[f[n], {n, 0, 61}] (* Ivan Neretin, May 09 2015 *)
PROG
(Scheme:) (define (A121663 n) (cond ((zero? n) 1) ((pow2? n) (+ 2 (A000523 n))) (else (* (+ 2 (A000523 n)) (A121663 (A053645 n))))))
(define (pow2? n) (and (> n 0) (zero? (A004198bi n (- n 1)))))
CROSSREFS
Bisection of A096111.
Sequence in context: A096113 A110797 A083872 * A096112 A052330 A344535
KEYWORD
nonn
AUTHOR
Antti Karttunen, Aug 25 2006
STATUS
approved