An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org:8891

In number theory, the Moser–de Bruijn sequence is an integer sequence named after Leo Moser and Nicolaas Govert de Bruijn, consisting of the sums of distinct powers of 4, or equivalently the numbers whose binary representations are nonzero only in even positions. A simple recurrence relation allows values of the Moser–de Bruijn sequence to be calculated from earlier values, and can be used to prove that the Moser–de Bruijn sequence is a 2-regular sequence.

Property Value
dbo:abstract
  • In number theory, the Moser–de Bruijn sequence is an integer sequence named after Leo Moser and Nicolaas Govert de Bruijn, consisting of the sums of distinct powers of 4, or equivalently the numbers whose binary representations are nonzero only in even positions. These numbers grow in proportion to the square numbers, and are the squares for a modified form of arithmetic without carrying. When the values in the sequence are doubled, their differences are all non-square. Every non-negative integer has a unique representation as the sum of a sequence member and a doubled sequence member. This decomposition into sums can be used to define a bijection between the integers and pairs of integers, to define coordinates for the Z-order curve, and to construct inverse pairs of transcendental numbers with simple decimal representations. A simple recurrence relation allows values of the Moser–de Bruijn sequence to be calculated from earlier values, and can be used to prove that the Moser–de Bruijn sequence is a 2-regular sequence. (en)
dbo:thumbnail
dbo:wikiPageID
  • 52299655 (xsd:integer)
dbo:wikiPageLength
  • 17825 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1122563507 (xsd:integer)
dbo:wikiPageWikiLink
dbp:id
  • Moser-deBruijnSequence (en)
dbp:mode
  • cs2 (en)
dbp:title
  • Moser–De Bruijn Sequence (en)
dbp:wikiPageUsesTemplate
dcterms:subject
rdf:type
rdfs:comment
  • In number theory, the Moser–de Bruijn sequence is an integer sequence named after Leo Moser and Nicolaas Govert de Bruijn, consisting of the sums of distinct powers of 4, or equivalently the numbers whose binary representations are nonzero only in even positions. A simple recurrence relation allows values of the Moser–de Bruijn sequence to be calculated from earlier values, and can be used to prove that the Moser–de Bruijn sequence is a 2-regular sequence. (en)
rdfs:label
  • Moser–de Bruijn sequence (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License