Skip to main content
SpringerLink
Log in

The use of bit and byte manipulation in computing summation sequences

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

The paper deals with summation sequences characterized by an arbitrary term being defined as a certain sum of preceding terms in the sequence. Bit- and bytemanipulating algorithms for construction of such sequences are described and discussed in some detail.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Peter N. Muller,On Properties of Unique Summation Sequences, Master Thesis, State University of New York at Buffalo, 1966.

  2. R. G. Schrandt and S. M. Ulam,On Recursively Defined Geometrical Objects and Patterns of Growth, technical report LA-3762, Los Alamos Scientific Laboratory.

  3. S. M. Ulam,Problem 111, Proceedings of the 1963 Number Theory Conference, Boulder, Colorado.

  4. M. C. Wuderlich,The Improbable Behavior of Ulam's Summation Sequence, to appear in the Proceedings of the Atlas Symposium on Computers in Number Theory.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Northern Illinois University, 60115, De Kalb, Illinois, U.S.A.

    M. C. Wunderlich

Authors
  1. M. C. Wunderlich
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wunderlich, M.C. The use of bit and byte manipulation in computing summation sequences. BIT 11, 217–224 (1971). https://doi.org/10.1007/BF01934371

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01934371

Keywords

Search

Navigation