Muhammad Kholilurrohman has authored 5 sequences.
A253107
Number of Eulerian cycles in a lattice graph bounded by the eight equations x+y=-2n, x+y=2n, x-y=-2n, x-y=2n, x=1-2n, x=2n-1, y=1-2n, and y=2n-1 (Aztec Diamond graph).
Original entry on oeis.org
1, 40, 132160, 33565612800, 641149227424067584, 911979417737022109612195840, 96089134887576552087085389330051891200, 747578503218020593242369202628724536730457230016512
Offset: 1
- P. Audibert, Mathematics for Informatics and Computer Science, Wiley, 2010, p. 832.
- Muhammad Kholilurrohman and Shin-ichi Minato, An Efficient Algorithm for Enumerating Eulerian Paths, Hokkaido University, Division of Computer Science, TCS Technical Reports, TCS-TR-A-14-77, Oct. 2014.
- Eric Weisstein's World of Mathematics, Eulerian Cycle
A252863
Number of Eulerian paths in a lattice graph bounded by the four equations x+y=1, x+y=2n, x-y=2, and x-y=-2.
Original entry on oeis.org
1, 16, 304, 5824, 111616, 2139136, 40996864, 785711104, 15058272256, 288594067456, 5530948993024, 106001474781184, 2031534311735296, 38934662638206976, 746188703776374784, 14300819473316184064, 274077370205901684736, 5252734292544974749696
Offset: 1
- Muhammad Kholilurrohman, Table of n, a(n) for n = 1..300
- P. Audibert, Mathematics for Informatics and Computer Science, Wiley, 2010, p. 824.
- Muhammad Kholilurrohman and Shin-ichi Minato, An Efficient Algorithm for Enumerating Eulerian Paths, Hokkaido University, Division of Computer Science, TCS Technical Reports, TCS-TR-A-14-77, Oct. 2014.
A247106
Number of paths joining opposite corners of an n X 4 grid with every vertex appearing at most twice in the path.
Original entry on oeis.org
5, 2100, 457712, 112269228, 28477328812, 7318410460100, 1890316186147022, 488986474759870194, 126570653719713453566, 32767699501924700122356, 8483817993681247935283336, 2196573666944370207848161336, 568727175315063817973036015946
Offset: 1
For n = 1 corresponds to a straight line graph with vertices {1,2,3,4}. Then the a(1) = 5 solutions are 1234, 121234, 123234, 123434, and 12123434.
A247070
Number of paths joining opposite corners of an n X 3 grid with every vertex appearing at most twice in the path.
Original entry on oeis.org
3, 218, 9482, 457712, 22375458, 1103498043, 54446999831, 2687689834743, 132666417488114, 6548713810387879, 323256199668617476, 15956549284724388645, 787645179268653581373, 38879655000676000582023, 1919173045780901708089448
Offset: 1
For n = 1 corresponds to a straight line graph with vertices {1,2,3}. Then the a(1) = 3 solutions are 123, 12123, and 12323.
A235389
Number of paths joining opposite corners of an n X n grid with every vertex appearing at most twice in the path.
Original entry on oeis.org
22, 9482, 112269228, 37515056726494, 355023905438833546724
Offset: 2
The 22 paths in a 2 X 2 grid whose nodes are numbered from 1 to 4 in the natural way are 124, 134, 12124, 12134, 12424, 12434, 13124, 13134, 13424, 13434, 1212434, 1213424, 1213434, 1242134, 1243124, 1243134, 1312424, 1312434, 1313424, 1342124, 1342134, 1343124. - _Giovanni Resta_, Mar 24 2014
Comments