|
Search: id:A096111
|
|
| |
|
| 1, 2, 2, 3, 3, 6, 6, 4, 4, 8, 8, 12, 12, 24, 24, 5, 5, 10, 10, 15, 15, 30, 30, 20, 20, 40, 40, 60, 60, 120, 120, 6, 6, 12, 12, 18, 18, 36, 36, 24, 24, 48, 48, 72, 72, 144, 144, 30, 30, 60, 60, 90, 90, 180, 180, 120, 120, 240, 240, 360, 360, 720, 720, 7, 7, 14, 14, 21, 21
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Each n > 1 occurs 2*A045778(n) times in the sequence.
|
|
FORMULA
|
G.f.: (Product(1+k*x^(2^(k-1)), k=1..infinity)-1)/x. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Nov 08 2005
|
|
PROGRAM
|
(Scheme:) (define (A096111 n) (cond ((pow2? (+ n 1)) (+ 2 (A000523 n))) (else (* (+ 1 (A000523 n)) (A096111 (A053645 n))))))
(define (pow2? n) (and (> n 0) (zero? (A004198bi n (- n 1)))))
|
|
CROSSREFS
|
Permutation of A096115, i.e. a(n) = A096115(A122198(n+1)) [Note the different starting offsets]. Bisection: A121663. C.f. A096113, A052330.
Sequence in context: A051715 A036817 A116417 this_sequence A101081 A038716 A035642
Adjacent sequences: A096108 A096109 A096110 this_sequence A096112 A096113 A096114
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 29 2004
|
|
EXTENSIONS
|
Edited, extended and Scheme code added by Antti Karttunen (His-Firstname.His-Surname(AT)gmail.com), Aug 25 2006
|
|
|
Search completed in 0.002 seconds
|
