Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
integer sequence
|
| gptkbp:alsoKnownAs |
gptkb:Stern's_sequence
gptkb:Stern–Brocot_sequence |
| gptkbp:application |
number theory
combinatorics continued fractions enumeration of rationals |
| gptkbp:definedIn |
a(0) = 0, a(1) = 1, a(2n) = a(n), a(2n+1) = a(n) + a(n+1)
|
| gptkbp:first_terms |
0, 1, 1, 2, 1, 3, 2, 3, 1, 4, 3, 5, 2, 5, 3, 4, ...
|
| gptkbp:firstPublished |
1858
|
| https://www.w3.org/2000/01/rdf-schema#label |
Stern's diatomic sequence
|
| gptkbp:namedAfter |
gptkb:Moritz_Abraham_Stern
|
| gptkbp:OEIS |
gptkb:A002487
|
| gptkbp:property |
a(n) is the numerator of the reduced fraction n/(2^k) for some k
a(n) counts the number of ways to write n as a sum of powers of 2, each power used at most twice a(n) is the number of hyperbinary representations of n |
| gptkbp:recurrence |
a(2n) = a(n)
a(2n+1) = a(n) + a(n+1) |
| gptkbp:relatedTo |
gptkb:Farey_sequence
gptkb:Stern–Brocot_tree |
| gptkbp:sequence |
non-negative integer sequence
|
| gptkbp:bfsParent |
gptkb:Stern's_sequence
|
| gptkbp:bfsLayer |
7
|