Stern–Brocot sequence

GPTKB entity

Statements (24)
Predicate Object
gptkbp:instanceOf integer sequence
gptkbp:alsoKnownAs gptkb:Stern's_diatomic_series
gptkbp:application number theory
combinatorics
enumeration of positive rational numbers
gptkbp:definedIn a(0) = 0, a(1) = 1, a(2n) = a(n), a(2n+1) = a(n) + a(n+1)
gptkbp:discoveredIn 19th century
gptkbp:first_terms 2
0
1
3
4
https://www.w3.org/2000/01/rdf-schema#label Stern–Brocot sequence
gptkbp:namedAfter gptkb:Achille_Brocot
gptkb:Moritz_Abraham_Stern
gptkbp:OEIS gptkb:A002487
gptkbp:property all positive rationals appear as a/b where a and b are consecutive terms
sequence is non-decreasing except for zeros at even indices
a(n) is the number of ways to write n as a sum of powers of 2, each power used at most twice
gptkbp:relatedTo gptkb:Farey_sequence
continued fractions
gptkbp:usedIn construction of the Stern–Brocot tree
gptkbp:bfsParent gptkb:Stern's_sequence
gptkbp:bfsLayer 7