login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051032 Summatory Rudin-Shapiro sequence for 2^(n-1). 2
2, 3, 3, 5, 5, 9, 9, 17, 17, 33, 33, 65, 65, 129, 129, 257, 257, 513, 513, 1025, 1025, 2049, 2049, 4097, 4097, 8193, 8193, 16385, 16385, 32769, 32769, 65537, 65537, 131073, 131073, 262145, 262145, 524289, 524289, 1048577, 1048577, 2097153 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Eric Weisstein's World of Mathematics, Rudin-Shapiro Sequence.
FORMULA
Apart from leading term, just A000051 (2^n + 1) doubled up.
G.f.: -x*(-2 - x + 4*x^2)/((x - 1)*(2*x^2 - 1)). - R. J. Mathar, Jul 15 2016
a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3). - Wesley Ivan Hurt, Aug 19 2022
E.g.f.: cosh(x) + cosh(sqrt(2)*x) + sinh(x) + sinh(sqrt(2)*x)/sqrt(2) - 2. - Stefano Spezia, Feb 05 2023
MATHEMATICA
d2n[n_]:=Module[{x=2^n+1}, {x, x}]; Join[{2}, Flatten[Array[d2n, 30]]] (* Harvey P. Dale, May 26 2011 *)
CROSSREFS
Sequence in context: A087153 A240176 A134408 * A106530 A273156 A294487
KEYWORD
nonn,easy
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 29 15:45 EDT 2024. Contains 372114 sequences. (Running on oeis4.)