A pattern sequence approach to Stern's sequence

From MaRDI portal
Publication:409393

DOI10.1016/J.DISC.2011.07.029zbMATH Open1315.11019DBLPjournals/dm/CoonsS11arXiv1105.0086OpenAlexW2132962549WikidataQ60692153 ScholiaQ60692153MaRDI QIDQ409393FDOQ409393

Jeffrey Shallit, Michael Coons

Publication date: 13 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Let w be a binary string and let a_w (n) be the number of occurrences of the word w in the binary expansion of n. As usual we let s(n) denote the Stern sequence; that is, s(0)=0, s(1)=1, and for n >= 1, s(2n)=s(n) and s(2n+1)=s(n)+s(n+1). In this note, we show that s(n) = a_1 (n) + sum_{w in 1 (0+1)*} s([w bar]) a_{w1} (n) where w bar denotes the complement of w (obtained by sending 0 to 1 and 1 to 0, and [w] denotes the integer specified by the word w interpreted in base 2.


Full work available at URL: https://arxiv.org/abs/1105.0086




Recommendations




Cites Work


Cited In (4)





This page was built for publication: A pattern sequence approach to Stern's sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409393)