Your browser does not fully support modern features. Please upgrade for a smoother experience.
Submitted Successfully!
Thank you for your contribution! You can also upload a video entry or images related to this topic. For video creation, please contact our Academic Video Service.
Version Summary Created by Modification Content Size Created at Operation
1 handwiki Sirius Huang -- 1750 2022-10-10 01:39:41

Video Upload Options

We provide professional Academic Video Service to translate complex research into visually appealing presentations. Would you like to try it?
Cite
If you have any further questions, please contact Encyclopedia Editorial Office.
HandWiki. Moser–De Bruijn Sequence. Encyclopedia. Available online: https://encyclopedia.pub/entry/28650 (accessed on 08 November 2026).
HandWiki. Moser–De Bruijn Sequence. Encyclopedia. Available at: https://encyclopedia.pub/entry/28650. Accessed November 08, 2026.
HandWiki. "Moser–De Bruijn Sequence" Encyclopedia, https://encyclopedia.pub/entry/28650 (accessed November 08, 2026).
HandWiki. (2022, October 10). Moser–De Bruijn Sequence. In Encyclopedia. https://encyclopedia.pub/entry/28650
HandWiki. "Moser–De Bruijn Sequence." Encyclopedia. Web. 10 October, 2022.

Moser–De Bruijn Sequence

Edit

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. No two doubled sequence members differ by a square, and 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.

transcendental numbers integer sequence recurrence relation

References

  1. Sloane, N. J. A., ed. "Sequence A000695 (Moser–De Bruijn sequence)". OEIS Foundation. https://oeis.org/A000695. 
  2. Arndt, Jörg (2011), Matters Computational: Ideas, Algorithms, Source Code, Springer, pp. 59, 750, http://jjj.de/fxt/fxtbook.pdf .
  3. "A mathematical investigation of games of "take-away"", Journal of Combinatorial Theory 1 (4): 443–458, 1966, doi:10.1016/S0021-9800(66)80016-9 . https://dx.doi.org/10.1016%2FS0021-9800%2866%2980016-9
  4. "Dismal arithmetic", Journal of Integer Sequences 14 (9): Article 11.9.8, 34, 2011, Bibcode: 2011arXiv1107.1130A, http://emis.ams.org/journals/JIS/VOL14/Sloane/carry2.pdf .
  5. "Difference sets without squares", Periodica Mathematica Hungarica 15 (3): 205–209, 1984, doi:10.1007/BF02454169 . https://dx.doi.org/10.1007%2FBF02454169
  6. The constants in this formula are expressed in hexadecimal and based on a 32-bit word size. The same bit pattern should be extended or reduced in the obvious way to handle other word sizes.
  7. "An application of generating series", Mathematics Magazine 35 (1): 37–38, 1962 .
  8. "Some direct decompositions of the set of integers", Mathematics of Computation 18: 537–546, 1964, doi:10.2307/2002940 . https://dx.doi.org/10.2307%2F2002940
  9. Eigen, S. J.; Ito, Y.; Prasad, V. S. (2004), "Universally bad integers and the 2-adics", Journal of Number Theory 107 (2): 322–334, doi:10.1016/j.jnt.2004.04.001 . https://dx.doi.org/10.1016%2Fj.jnt.2004.04.001
  10. Thiyagalingam, Jeyarajan; Beckmann, Olav; Kelly, Paul H. J. (September 2006), "Is Morton layout competitive for large two-dimensional arrays yet?", Concurrency and Computation: Practice and Experience 18 (11): 1509–1539, doi:10.1002/cpe.v18:11, http://www.doc.ic.ac.uk/~ob3/Publications/CandCPEMorton2004.pdf, retrieved 2016-11-18 .
  11. "Continued fractions of formal power series", Advances in number theory (Kingston, ON, 1991), Oxford Sci. Publ., Oxford Univ. Press, New York, 1993, pp. 453–466, http://web.williams.edu/Mathematics/sjmiller/public_html/book/papers/vdp/Poorten_ContFracsOfFormalPowerSeries.pdf .
  12. Blanchard, André; Mendès France, Michel (1982), "Symétrie et transcendance", Bulletin des Sciences Mathématiques 106 (3): 325–335 . As cited by (van der Poorten 1993).
  13. "On the binary expansions of algebraic numbers", Journal de Théorie des Nombres de Bordeaux 16 (3): 487–518, 2004, doi:10.5802/jtnb.457, http://jtnb.cedram.org/item?id=JTNB_2004__16_3_487_0 . See in particular the discussion following Theorem 4.2.
  14. "Integers with digits 0 or 1", Mathematics of Computation 46 (174): 683–689, 1986, doi:10.2307/2008006 . https://dx.doi.org/10.2307%2F2008006
  15. Allouche, Jean-Paul (1992), "The ring of k-regular sequences", Theoretical Computer Science 98 (2): 163–197, doi:10.1016/0304-3975(92)90001-V . Example 13, p. 188. https://dx.doi.org/10.1016%2F0304-3975%2892%2990001-V
More
Upload a video for this entry
Information
Subjects: Mathematics
Contributor MDPI registered users' name will be linked to their SciProfiles pages. To register with us, please refer to https://encyclopedia.pub/register :
View Times: 1.4K
Entry Collection: HandWiki
Revision: 1 time (View History)
Update Date: 10 Oct 2022
Notice
You are not a member of the advisory board for this topic. If you want to update advisory board member profile, please contact office@encyclopedia.pub.
OK
Confirm
Only members of the Encyclopedia advisory board for this topic are allowed to note entries. Would you like to become an advisory board member of the Encyclopedia?
Yes
No
${ textCharacter }/${ maxCharacter }
Submit
Cancel
There is no comment~
${ textCharacter }/${ maxCharacter }
Submit
Cancel
${ selectedItem.replyTextCharacter }/${ selectedItem.replyMaxCharacter }
Submit
Cancel
Confirm
Are you sure to Delete?
Yes No
Write an Entry