Results 1 
3 of
3
The Encyclopedia of Integer Sequences
"... This article gives a brief introduction to the OnLine Encyclopedia of Integer Sequences (or OEIS). The OEIS is a database of nearly 90,000 sequences of integers, arranged lexicographically. The entry for a sequence lists the initial terms (50 to 100, if available), a description, formulae, programs ..."
Abstract

Cited by 656 (15 self)
 Add to MetaCart
(Show Context)
This article gives a brief introduction to the OnLine Encyclopedia of Integer Sequences (or OEIS). The OEIS is a database of nearly 90,000 sequences of integers, arranged lexicographically. The entry for a sequence lists the initial terms (50 to 100, if available), a description, formulae, programs to generate the sequence, references, links to relevant web pages, and other
Some Canonical Sequences of Integers
, 1995
"... Introduction to Combinatorial Analysis, Wiley, NY, 1958. [46] J. Riordan, Combinatorial Identities, Wiley, NY, 1968. [47] J. Riordan and C. E. Shannon, The number of twoterminal seriesparallel networks, J. Math. Phys., 21 (1942), 8393. Reprinted in C. E. Shannon, Collected Ppaers, edited N. J. A ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
(Show Context)
Introduction to Combinatorial Analysis, Wiley, NY, 1958. [46] J. Riordan, Combinatorial Identities, Wiley, NY, 1968. [47] J. Riordan and C. E. Shannon, The number of twoterminal seriesparallel networks, J. Math. Phys., 21 (1942), 8393. Reprinted in C. E. Shannon, Collected Ppaers, edited N. J. A. Sloane and A. D. Wyner, IEEE Press, NY, 1993. [48] F. S. Roberts, Applied. Combinatorics, PrenticeHall, Englewood Cliffs, NJ, 1984. [49] D. G. Rogers, A Schroder triangle: three combinatorial problems, in Combinatorial Mathematics V (Melbourne 1976), ed. C. H. C. Little, Lecture Notes in math., Vol. 622 (1977), pp. 175196. [50] G.C. Rota, The number of partitions of a set, Amer. Math. Monthly, 71 (1964), 498504. [51] G.C. Rota et al., Finite Operator Calculus, Academic Press, NY, 1975. [52] M. Schader,