login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A020991 Largest value of k for which Golay-Rudin-Shapiro sequence A020986(k) = n. 4
0, 3, 6, 15, 26, 27, 30, 63, 106, 107, 110, 111, 122, 123, 126, 255, 426, 427, 430, 431, 442, 443, 446, 447, 490, 491, 494, 495, 506, 507, 510, 1023, 1706, 1707, 1710, 1711, 1722, 1723, 1726, 1727, 1770, 1771, 1774, 1775, 1786, 1787, 1790, 1791, 1962, 1963 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Seiichi Manyama, Table of n, a(n) for n = 1..10000

J. Brillhart and P. Morton, A case study in mathematical research: the Golay-Rudin-Shapiro sequence, Amer. Math. Monthly, 103 (1996) 854-869.

Eric Weisstein's World of Mathematics, Rudin-Shapiro Sequence

FORMULA

a(2^n) = 2^(2n) - 1. - Seiichi Manyama, Apr 23 2017

CROSSREFS

Cf. A020986, A212591.

Sequence in context: A287189 A284168 A216304 * A079825 A327067 A252745

Adjacent sequences:  A020988 A020989 A020990 * A020992 A020993 A020994

KEYWORD

nonn

AUTHOR

N. J. A. Sloane

EXTENSIONS

More terms from Robert G. Wilson v; further extended by David W. Wilson, June 1997

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 25 14:47 EST 2020. Contains 338625 sequences. (Running on oeis4.)