A new property of Stern's sequence and a fast algorithm for calculating the nth term of the sequence

##plugins.themes.bootstrap3.article.main##

##plugins.themes.bootstrap3.article.sidebar##

PDF (Euskara)
Published 02-05-2019
DOI https://doi.org/10.1387/ekaia.19513
Yosu Yurramendi Mendizabal
Euskal Herriko Unibertsitatea
http://orcid.org/0000-0002-4399-600X

Abstract

 

Stern's sequence consists of natural numbers and has many properties. A new property of the sequence is given in this work, by which the value of the nth term is quickly calculated. This quickness is based on the representation of n in the binary system. It is explained how the property has arisen, as well as the mathematical proof of its truth.

 

 

Abstract 363 | PDF (Euskara) Downloads 475

##plugins.themes.bootstrap3.article.details##

Keywords

Stern sequence, recursion, experimental mathematics

Issue
No. 35 (2019): EKAIA 35
Section
Ale Arrunta
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

(C) UPV/EHU Press
 
CC-BY-NC-SA