Integer Sequences
Below follows the list of all integer sequences in the The On-Line Encyclopedia of Integer Sequences which have a reference to one
of my pages.
- A001582
Domino tilings in W4 x Pn.
- A001835
Domino tilings in P3 x P2n.
See also Opera Omnia by L. Euler, Teubner, Leipzig, 1911,
Series (1), Vol. 1, p. 375,
Side-and-diagonal numbers by F. V. Waugh and M. W. Maxfield, Math.
Mag., 40 (1967), 74-83, and
Concrete Mathematics by R. L. Graham,
D. E. Knuth and O. Patashnik,
Addison-Wesley, Reading, MA, 1990, p. 329.
- A003682
Hamilton paths in K2 x Pn.
- A003685
Hamiltonian paths in P3 x Pn.
- A003688
2-factors in K3 x Pn.
- A003689
Hamilton paths in K3 x Pn.
- A003690
Spanning trees in K3 x Pn.
- A003691
Spanning trees with degree 1 and 3 in K3 x P2n.
- A003693
2-factors in P4 x Pn.
- A003695
Hamilton paths in P4 x Pn.
- A003696
Spanning trees in P4 x Pn.
- A003697
Domino tilings in C4 x Pn.
(Duplicate of A006253.)
- A003698
2-factors in C4 x Pn.
- A003699
Hamilton cycles in C4 x Pn.
- A003729
Domino tilings in C5 x P2n.
- A003730
2-factors in C5 x Pn.
- A003731
Hamilton cycles in C5 x Pn.
- A003732
Hamilton paths in C5 x Pn.
- A003733
Spanning trees in C5 x Pn.
- A003734
Spanning trees with degree 1 and 3 in C5 x P2n.
- A003735
Domino tilings in W5 x P2n.
- A003736
2-factors in W5 x Pn.
- A003737
Hamilton cycles in W5 x Pn.
- A003738
Hamilton paths in W5 x Pn.
- A003739
Spanning trees in W5 x Pn.
- A003740
Spanning trees with degree 1 and 3 in W5 x P2n.
- A003741
Domino tilings in O5 x P2n.
- A003742
2-factors in O5 x Pn.
- A003743
Hamilton cycles in O5 x Pn.
- A003744
Hamilton paths in O5 x Pn.
- A003745
Spanning trees in O5 x Pn.
- A003746
Spanning trees with degree 1 and 3 in O5 x P2n.
- A003747
Domino tilings in K5 x P2n.
- A003748
2-factors in K5 x Pn.
- A003749
Hamilton cycles in K5 x Pn.
- A003750
Hamilton paths in K5 x Pn.
- A003751
Spanning trees in K5 x Pn.
- A003752
Hamilton paths in C4 x Pn.
- A003753
Spanning trees in C4 x Pn.
- A003755
Spanning trees in S4 x Pn.
- A003756
Spanning trees with degree 1 and 3 in S4 x P2n-1.
- A003757
Domino tilings in D4 x Pn.
- A003758
2-factors in D4 x Pn.
- A003759
Hamilton cycles in D4 x Pn.
- A003760
Hamilton paths in D4 x Pn.
- A003761
Spanning trees in D4 x Pn.
- A003762
Spanning trees with degree 1 and 3 in D4 x Pn.
- A003763
Number of Hamiltonian cycles on 2n X 2n square grid of points.
- A003764
2-factors in W4 x Pn.
- A003765
Hamilton cycles in W4 x Pn.
- A003766
Hamilton paths in W4 x Pn.
- A003767
Spanning trees in W4 x Pn.
- A003768
Spanning trees with degree 1 and 3 in W4 x Pn.
- A003769
Domino tilings in K4 x Pn.
- A003770
2-factors in K4 x Pn.
- A003771
Hamilton cycles in K4 x Pn.
- A003772
Hamilton paths in K4 x Pn.
- A003773
Spanning trees in K4 x Pn.
- A003774
Spanning trees with degree 1 and 3 in K4 x Pn.
- A003775
Domino tilings in P5 x P2n.
- A003776
2-factors in P5 x P2n.
- A003778
Hamilton paths in P5 x Pn.
- A003779
Spanning trees in P5 x Pn.
- A003780
Spanning trees with degree 1 and 3 in P5 x Pn.
- A003945
Hamilton cycles in K3 x Pn.
- A003948
Hamilton path in S4 x Pn.
- A004253
Domino tilings in K3 x P2n-2 and
Domino tilings in S4 x P2n-2.
Also Pythagoras' theorem generalized.
- A005178
Domino tilings in P4 x Pn.
See also page 252 of Enumerative Combinatorics I by Stanley.
- A006192
Number of nonintersecting rook paths joining opposite corners of 3 X n board.
- A006238
Spanning trees in P3 x Pn.
See also Complexite et circuits Euleriens dans la sommes
tensorielles de graphes by G. Kreweras, in J. Combin. Theory,
B 24 (1978), 202-212.
- A006253
Domino tilings in C4 x Pn.
(Duplicate of A003697.)
- A006864
Hamilton cycles in P4 x Pn.
See also On the number of Hamilton cycles of P4 x
Pn by R. Tosic et al., Indian J.
of Pure and Applied Math. 21 (1990), 403-409, and
Enumeration of Hamiltonian cycles in P4
x Pn and P5 x Pn
by Y.H.H. Kwong in Ars Combin. 33 (1992), 87-96.
- A006865
Hamilton cycles in P5 x P2n
See also Enumeration of Hamiltonian cycles in P4
x Pn and P5 x Pn
by Y.H.H. Kwong in Ars Combin. 33 (1992), 87-96, and
A Matrix Method for Counting Hamiltonian Cycles on Grid Graphs by
Y.H.H. Kwong in European J. of Combinatorics 15 (1994), 277-283.
- A007786
Number of nonintersecting rook paths joining opposite corners of 4 X n board.
- A007787
Number of nonintersecting rook paths joining opposite corners of 5 X n board.
- A022541
Related to number of irreducible stick-cutting problems.
- A022542
Minimum number of possible solutions for all irreducible
stick-cutting problems.
- A028468
Domino tilings in P6 x Pn.
- A028469
Domino tilings in P7 x Pn.
- A028470
Domino tilings in P8 x Pn.
- A092088
Spanning trees with degree 1 and 3 in K5 x Pn.
- A092135
Number of spanning trees with degrees 1 and 3 in S5 x P4n+2. (I did not calculate this result.)
- A092136
Number of spanning trees in S5 x P4n+2. (I did not calculate this result.)
- A099390
Array T(m,n) read by antidiagonals: number of domino tilings of the m X n grid.
- A145400
2-factors in P6 x Pn.
- A145401
Hamilton cycles in P6 x Pn.
- A145402
Hamilton paths in P6 x Pn.
- A145403
Number of nonintersecting rook paths joining opposite corners of 6 X n board.
- A145404
Domino tilings in O6 x Pn.
- A145405
2-factors in O6 x Pn.
- A145406
Hamilton cycles in O6 x Pn.
- A145407
Hamilton paths in O6 x Pn.
- A145408
Spanning trees with degree 1 and 3 in O6 x Pn.
- A145409
Domino tilings in K6 x Pn.
- A145410
2-factors in K6 x Pn.
- A145411
Hamilton cycles in K6 x Pn.
- A145412
Hamilton paths in K6 x Pn.
- A145413
Spanning trees with degree 1 and 3 in K6 x Pn.
- A145414
Paths in K6 x Pn connecting two different vertices in K6 from opposite sides.
- A145415
2-factors in P7 x Pn.
- A145416
Hamilton cycles in P7 x Pn.
- A145417
2-factors in P8 x Pn.
- A145418
Hamilton cycles in P8 x Pn.
- A145418
Hamilton cycles in P8 x Pn.
- A239318
Number of visible unit cubes, aligned with a three-dimensional Cartesian mesh,
completely within the first octant of a sphere centered at the origin, ordered by increasing radius.
- A253316
Takuzu: 10 by 10.
home and email