|
| |
|
|
A119608
|
|
Let b(1)=0, b(2)= 1. b(2^m +k) = (b(2^m+1-k) + b(k))/2, 1<=k<=2^m, m >= 0. a(n) is numerator of b(n).
|
|
1
| |
|
|
0, 1, 1, 1, 1, 3, 3, 1, 1, 7, 5, 3, 3, 5, 7, 1, 1, 15, 9, 7, 5, 11, 13, 3, 3, 13, 11, 5, 7, 9, 15, 1, 1, 31, 17, 15, 9, 23, 25, 7, 5, 27, 21, 11, 13, 19, 29, 3, 3, 29, 19, 13, 11, 21, 27, 5, 7, 25, 23, 9, 15, 17, 31, 1, 1, 63, 33, 31, 17, 47, 49, 15, 9, 55, 41, 23, 25, 39, 57, 7, 5, 59, 37
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,6
|
|
|
COMMENTS
| Denominator of b(n), for n >=2, is A053644(n-1).
|
|
|
MAPLE
| A119608 := proc (mmax) local a, b, m, k, bn, i; b := [0, 1] ; for m from 1 to mmax do for k from 1 to 2^m do bn := (b[2^m+1-k]+b[k])/2 ; b := [op(b), bn] ; od ; od ; a := [] ; for i from 1 to nops(b) do a := [op(a), numer(b[i])] ; od ; RETURN(a) ; end: an := A119608(7) : for i from 1 to nops(an) do printf("%d, ", an[i]) ; od ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 06 2006
|
|
|
CROSSREFS
| Cf. A053644.
Sequence in context: A026515 A075772 A142157 * A196646 A196601 A196578
Adjacent sequences: A119605 A119606 A119607 * A119609 A119610 A119611
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Leroy Quet Jun 04 2006
|
|
|
EXTENSIONS
| More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 06 2006
|
| |
|
|
