|
Search: id:A119614
|
|
|
| A119614 |
|
a(1)=1. a(2^m +k) = a(2^m +1-k)*a(k) +1, where 1<=k<=2^m, m>=0. |
|
+0
1
|
|
| 1, 2, 3, 3, 4, 7, 7, 4, 5, 15, 22, 13, 13, 22, 15, 5, 6, 31, 67, 40, 53, 155, 106, 21, 21, 106, 155, 53, 40, 67, 31, 6, 7, 63, 202, 121, 213, 1086, 743, 85, 106, 1591, 3411, 690, 521, 1475, 466, 31, 31, 466, 1475, 521, 690, 3411, 1591, 106, 85, 743, 1086, 213, 121, 202
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
MAPLE
|
A119614 := proc (mmax) local a, m, k, an; a := [1] ; for m from 0 to mmax do for k from 1 to 2^m do an := a[2^m+1-k]*a[k]+1 ; a := [op(a), an] ; od ; od ; RETURN(a) ; end: an := A119614(6) : 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
|
Sequence in context: A078467 A049790 A119795 this_sequence A035540 A114863 A035535
Adjacent sequences: A119611 A119612 A119613 this_sequence A119615 A119616 A119617
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Jun 05 2006
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 06 2006
|
|
|
Search completed in 0.002 seconds
|
