Skip to main content

Abstract

A sequence is simply a set whose elements are labelled by the positive integers (though a more formal definition is given in the next section). We write a sequence in the form s = (s1,s2, s3,…) where the dots indicate that the list of terms continues indefinitely, so that any term, for instance s491, is available for consideration if required. More explicitly we write s = (s1, s2, s3,…, sn,…) to indicate the nth term, or simply s = (2n) 1 . But sn alone (no parentheses!) is not the name of a sequence, it is the name of a number which is the nth term of a sequence. For instance s = (2n - 1) 1 is the sequence of odd integers, s = (1,3,5,…) whose nth term is sn = 2n - 1.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag London

About this chapter

Cite this chapter

Walker, P.L. (2004). Sequences. In: Examples and Theorems in Analysis. Springer, London. https://doi.org/10.1007/978-0-85729-380-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-0-85729-380-0_1

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-493-2

  • Online ISBN: 978-0-85729-380-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics