Some sequences of integers

Peter J. Cameron

doi:10.1016/0012-365X(89)90081-2

Some sequences of integers

Peter J. Cameron^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Abstract

Combinatorialists are interested in sequences of integers which count things. We often find that the same sequence counts two families of things with no obvious connection, or that a simple translation connects the answers to two counting problems. In this way, unexpected connections have come to light.

Original language	English
Pages (from-to)	89-102
Number of pages	14
Journal	Discrete Mathematics
Volume	75
Issue number	1-3
DOIs	https://doi.org/10.1016/0012-365X(89)90081-2
Publication status	Published - 1 May 1989

Access to Document

10.1016/0012-365X(89)90081-2

Cite this

@article{e976e7d99fe14a95a2466f01a8a388d6,

title = "Some sequences of integers",

abstract = "Combinatorialists are interested in sequences of integers which count things. We often find that the same sequence counts two families of things with no obvious connection, or that a simple translation connects the answers to two counting problems. In this way, unexpected connections have come to light.",

author = "Cameron, {Peter J.}",

year = "1989",

month = may,

day = "1",

doi = "10.1016/0012-365X(89)90081-2",

language = "English",

volume = "75",

pages = "89--102",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - Some sequences of integers

AU - Cameron, Peter J.

PY - 1989/5/1

Y1 - 1989/5/1

N2 - Combinatorialists are interested in sequences of integers which count things. We often find that the same sequence counts two families of things with no obvious connection, or that a simple translation connects the answers to two counting problems. In this way, unexpected connections have come to light.

AB - Combinatorialists are interested in sequences of integers which count things. We often find that the same sequence counts two families of things with no obvious connection, or that a simple translation connects the answers to two counting problems. In this way, unexpected connections have come to light.

UR - http://www.scopus.com/inward/record.url?scp=38249023344&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(89)90081-2

DO - 10.1016/0012-365X(89)90081-2

M3 - Article

AN - SCOPUS:38249023344

SN - 0012-365X

VL - 75

SP - 89

EP - 102

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

Some sequences of integers

Abstract

Access to Document

Other files and links

Fingerprint

Cite this