A Handbook of Integer Sequences
A Handbook of Integer Sequences contains a main table of 2300 sequences of integers that are collected from all branches of mathematics and science.
This handbook describes how to use the main table and provides methods for analyzing and describing unknown and important sequences. This compilation also serves as an index to the literature for locating references on a particular problem and quickly finds numbers such as 712, number of partitions of 30, 18th Catalan number, or expansion of ? to 60 decimal places. Other topics include the method of differences, self-generating sequences, polyominoes, permutations, and puzzle sequences.
This publication is a good source for students and researchers who are confronted with strange and important sequences.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
BAMS BEATTY SEQUENCE BERNOULL NUMBERS BIPARTITE PARTITIONS BOOLEAN FUNCTIONS CENTRAL FACTORIAL NUMBERS CHEBYSHEV POLYNOMIALS CLASS NUMBERS COEFFICIENTS FOR NUMERICAL CUBIC LATTICE DISCORDANT PERMUTATIONS DIVISOR FUNCTION EULER NUMBERS EULERS TOTIENT FUNCTION FIBONACCI FIBONACCI NUMBERS FIGURATE NUMBERS FUNCTION REF LENGTH OF RUNS MODULAR FORM NECKLACES NUMERICAL DIFFERENTIATION PARTIALLY ORDERED SETS PARTITION FUNCTION PARTITIONS INTO NON-INTEGRAL PARTITIONS OF PRIMES PERMUTATIONS PERMUTATIONS BY LENGTH PERMUTATIONS BY NUMBER POLYGON POLYOMINOES POST FUNCTIONS QUADRATIC PARTITIONS REF AMM REF AMP 46 REF BA1 REF CAY 9 REF CJM REF CMB REF CU21 REF DKB REF DMJ REF EUL REF FQ REF IBMJ REF JCT REF JF REF JFI 276 REF MTAC REF MTAC 21 REF PCPS 47 REF PEF 77 REF PLMS REF PNIS REF QJM 38 REF R1 REF RCI REF SMA 20 RELATED TO EULER REPRESENTATION AS SUMS RESTRICTED PARTITIONS ROOTED TREE SELF-GENERATING SEQUENCE SEQUENCES BEGINNING SWITCHING NETWORKS TANGENT NUMBERS