# 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.
1. A001582 Domino tilings in W4 x Pn.
2. 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.
3. A003682 Hamilton paths in K2 x Pn.
4. A003685 Hamiltonian paths in P3 x Pn.
5. A003688 2-factors in K3 x Pn.
6. A003689 Hamilton paths in K3 x Pn.
7. A003690 Spanning trees in K3 x Pn.
8. A003691 Spanning trees with degree 1 and 3 in K3 x P2n.
9. A003693 2-factors in P4 x Pn.
10. A003695 Hamilton paths in P4 x Pn.
11. A003696 Spanning trees in P4 x Pn.
12. A003697 Domino tilings in C4 x Pn. (Duplicate of A006253.)
13. A003698 2-factors in C4 x Pn.
14. A003699 Hamilton cycles in C4 x Pn.
15. A003729 Domino tilings in C5 x P2n.
16. A003730 2-factors in C5 x Pn.
17. A003731 Hamilton cycles in C5 x Pn.
18. A003732 Hamilton paths in C5 x Pn.
19. A003733 Spanning trees in C5 x Pn.
20. A003734 Spanning trees with degree 1 and 3 in C5 x P2n.
21. A003735 Domino tilings in W5 x P2n.
22. A003736 2-factors in W5 x Pn.
23. A003737 Hamilton cycles in W5 x Pn.
24. A003738 Hamilton paths in W5 x Pn.
25. A003739 Spanning trees in W5 x Pn.
26. A003740 Spanning trees with degree 1 and 3 in W5 x P2n.
27. A003741 Domino tilings in O5 x P2n.
28. A003742 2-factors in O5 x Pn.
29. A003743 Hamilton cycles in O5 x Pn.
30. A003744 Hamilton paths in O5 x Pn.
31. A003745 Spanning trees in O5 x Pn.
32. A003746 Spanning trees with degree 1 and 3 in O5 x P2n.
33. A003747 Domino tilings in K5 x P2n.
34. A003748 2-factors in K5 x Pn.
35. A003749 Hamilton cycles in K5 x Pn.
36. A003750 Hamilton paths in K5 x Pn.
37. A003751 Spanning trees in K5 x Pn.
38. A003752 Hamilton paths in C4 x Pn.
39. A003753 Spanning trees in C4 x Pn.
40. A003755 Spanning trees in S4 x Pn.
41. A003756 Spanning trees with degree 1 and 3 in S4 x P2n-1.
42. A003757 Domino tilings in D4 x Pn.
43. A003758 2-factors in D4 x Pn.
44. A003759 Hamilton cycles in D4 x Pn.
45. A003760 Hamilton paths in D4 x Pn.
46. A003761 Spanning trees in D4 x Pn.
47. A003762 Spanning trees with degree 1 and 3 in D4 x Pn.
48. A003763 Number of Hamiltonian cycles on 2n X 2n square grid of points.
49. A003764 2-factors in W4 x Pn.
50. A003765 Hamilton cycles in W4 x Pn.
51. A003766 Hamilton paths in W4 x Pn.
52. A003767 Spanning trees in W4 x Pn.
53. A003768 Spanning trees with degree 1 and 3 in W4 x Pn.
54. A003769 Domino tilings in K4 x Pn.
55. A003770 2-factors in K4 x Pn.
56. A003771 Hamilton cycles in K4 x Pn.
57. A003772 Hamilton paths in K4 x Pn.
58. A003773 Spanning trees in K4 x Pn.
59. A003774 Spanning trees with degree 1 and 3 in K4 x Pn.
60. A003775 Domino tilings in P5 x P2n.
61. A003776 2-factors in P5 x P2n.
62. A003778 Hamilton paths in P5 x Pn.
63. A003779 Spanning trees in P5 x Pn.
64. A003780 Spanning trees with degree 1 and 3 in P5 x Pn.
65. A003945 Hamilton cycles in K3 x Pn.
66. A003948 Hamilton path in S4 x Pn.
67. A004253 Domino tilings in K3 x P2n-2 and Domino tilings in S4 x P2n-2. Also Pythagoras' theorem generalized.
68. A005178 Domino tilings in P4 x Pn. See also page 252 of Enumerative Combinatorics I by Stanley.
69. A006192 Number of nonintersecting rook paths joining opposite corners of 3 X n board.
70. 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.
71. A006253 Domino tilings in C4 x Pn. (Duplicate of A003697.)
72. 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.
73. 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.
74. A007786 Number of nonintersecting rook paths joining opposite corners of 4 X n board.
75. A007787 Number of nonintersecting rook paths joining opposite corners of 5 X n board.
76. A022541 Related to number of irreducible stick-cutting problems.
77. A022542 Minimum number of possible solutions for all irreducible stick-cutting problems.
78. A028468 Domino tilings in P6 x Pn.
79. A028469 Domino tilings in P7 x Pn.
80. A028470 Domino tilings in P8 x Pn.
81. A092088 Spanning trees with degree 1 and 3 in K5 x Pn.
82. A092135 Number of spanning trees with degrees 1 and 3 in S5 x P4n+2. (I did not calculate this result.)
83. A092136 Number of spanning trees in S5 x P4n+2. (I did not calculate this result.)
84. A099390 Array T(m,n) read by antidiagonals: number of domino tilings of the m X n grid.
85. A145400 2-factors in P6 x Pn.
86. A145401 Hamilton cycles in P6 x Pn.
87. A145402 Hamilton paths in P6 x Pn.
88. A145403 Number of nonintersecting rook paths joining opposite corners of 6 X n board.
89. A145404 Domino tilings in O6 x Pn.
90. A145405 2-factors in O6 x Pn.
91. A145406 Hamilton cycles in O6 x Pn.
92. A145407 Hamilton paths in O6 x Pn.
93. A145408 Spanning trees with degree 1 and 3 in O6 x Pn.
94. A145409 Domino tilings in K6 x Pn.
95. A145410 2-factors in K6 x Pn.
96. A145411 Hamilton cycles in K6 x Pn.
97. A145412 Hamilton paths in K6 x Pn.
98. A145413 Spanning trees with degree 1 and 3 in K6 x Pn.
99. A145414 Paths in K6 x Pn connecting two different vertices in K6 from opposite sides.
100. A145415 2-factors in P7 x Pn.
101. A145416 Hamilton cycles in P7 x Pn.
102. A145417 2-factors in P8 x Pn.
103. A145418 Hamilton cycles in P8 x Pn.
104. A145418 Hamilton cycles in P8 x Pn.
105. 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.
106. A253316 Takuzu: 10 by 10.

home and email