cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-10 of 10 results.

A176086 Partial sums of A001394.

Original entry on oeis.org

1, 5, 17, 53, 161, 485, 1433, 4229, 12425, 36485, 106673, 311957, 909953, 2654501, 7728401, 22503053, 65425505, 190239989, 552507641, 1604779373, 4656679889
Offset: 0

Views

Author

Jonathan Vos Post, Apr 08 2010

Keywords

Comments

Partial sums of number of n-step self-avoiding walks on diamond. The subsequence of primes in this partial sum begins: 5, 17, 53, 1433, 4229, 311957, 2654501, 7728401, 1604779373.

Examples

			a(19) = 1 + 4 + 12 + 36 + 108 + 324 + 948 + 2796 + 8196 + 24060 + 70188 + 205284 + 597996 + 1744548 + 5073900 + 14774652 + 42922452 + 124814484 + 362267652 + 1052271732 = 1604779373 is prime .
		

Crossrefs

Cf. A001394.

Formula

a(n) = SUM[i=0..n] A001394(i).

A334877 Number of self-avoiding walks on a 2-dimensional square lattice where the walk consists of steps with incrementing length from 1 to n.

Original entry on oeis.org

1, 4, 12, 36, 108, 324, 948, 2740, 7892, 22540, 64020, 181396, 511828, 1440652, 4045676, 11322732, 31615780, 88100644, 245143676, 681002276, 1888943100, 5233741636, 14484853148, 40043579596, 110590828396, 305133547724
Offset: 0

Views

Author

Scott R. Shannon, May 13 2020

Keywords

Comments

This sequence gives the number of self-avoiding walks on a 2-dimensional square lattice where the walk starts with a step length of 1 which then increments by 1 after each step up until the step length is n.
The first time a collision with a previous step can occur is for n = 6. This can occur in three different ways. For example a walk with steps of length 1,2 and 3 to the right, a step of length 4 upward, then a step of length 5 to the left. A step of length 6 downward would now result in a collision. Requiring six steps before a collision is in contrast to the standard 2D square lattice SAW of A001411 where a collision can occur on the fourth step.
Note that this sequence agrees with a SAW on the diamond lattice, A001394, for the first 7 terms, even though the seventh term here has some walks removed due to the above collision.

Examples

			a(1) = 4. These are the four directions one can step away from a point on a 2D square lattice.
a(2) = 12. These consist of the two following walks:
.
    *
    |        1     2
    . 2    *---*---.---*
    |
*---*
  1
.
The first walk can be taken in 8 different ways, the second in 4 ways, giving a total of 12 walks.
a(3) = 36. These consist of the following five walks:
.
    *                                                           *
    |                                                           |
    .              3                     3                      .
    | 3      *---.---.---*         *---.---.---*                | 3
    .                    |         |                            .
    |                    . 2       . 2                          |
    *                    |         |                *---*---.---*
    |                *---*     *---*                  1     2
    . 2                1         1
    |                                     *---*---.---*---.---.---*
*---*                                       1     2          3
  1
.
The first four can be taken in 8 different ways, while the last straight walk can be taken in 4 ways, giving a total of 36 walks. Notice it is not possible to form a collision from any of these walks by adding a step of length 4.
		

Crossrefs

A227715 Triangle read by rows: Number of 2n-step self-avoiding walks on diamond lattice ending at point with x = 2k.

Original entry on oeis.org

1, 4, 4, 28, 24, 16, 188, 188, 128, 64, 1428, 1368, 1120, 640, 256, 10708, 10572, 8864, 6208, 3072, 1024, 82948, 81376, 71572, 53376, 32768, 14336, 4096, 644788, 637148, 570512, 453424, 304640, 166912, 65536, 16384, 5067404, 5007560, 4572076, 3762672, 2728256, 1669120
Offset: 0

Views

Author

Joseph Myers, Jul 21 2013

Keywords

Comments

The number of walks ending with x = -k is the same as the number ending with x = k.

Examples

			Initial rows (paths of length 0, 2, 4, ...):
{ 1 };
{ 4, 4 };
{ 28, 24, 16 };
{ 188, 188, 128, 64 }.
		

Crossrefs

A227716 Triangle read by rows: Number of (2n+1)-step self-avoiding walks on diamond lattice ending at point with x = 2k+1.

Original entry on oeis.org

2, 10, 8, 74, 56, 32, 518, 464, 288, 128, 3934, 3520, 2656, 1408, 512, 29914, 27768, 21920, 14336, 6656, 2048, 232094, 217316, 181456, 128256, 74240, 30720, 8192, 1812890, 1719616, 1475172, 1118592, 716288, 372736, 139264, 32768, 14277886, 13633972, 11989800, 9480048
Offset: 0

Views

Author

Joseph Myers, Jul 21 2013

Keywords

Comments

The number of walks ending with x = -k is the same as the number ending with x = k.

Examples

			Initial rows (paths of length 1, 3, 5, ...):
{ 2 };
{ 10, 8 };
{ 74, 56, 32 };
{ 518, 464, 288, 128 }.
		

Crossrefs

A001395 Number of (2n+1)-step self-avoiding walks on diamond lattice ending at point with x = 1.

Original entry on oeis.org

2, 10, 74, 518, 3934, 29914, 232094, 1812890, 14277886, 113016230, 898797262, 7173454238, 57431351010, 460989676450, 3708603354110, 29893215059758
Offset: 0

Views

Author

Keywords

References

  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Extensions

Edited and extended by Joseph Myers, Jul 21 2013
a(12)-a(13) from Sean A. Irvine, Nov 13 2017
a(14)-a(15) from Bert Dobbelaere, Jan 12 2019

A001396 Number of 2n-step self-avoiding walks on diamond lattice ending at point with x = 0.

Original entry on oeis.org

1, 4, 28, 188, 1428, 10708, 82948, 644788, 5067404, 40016460, 317727164, 2532064332, 20247784124, 162353831796, 1304943724900, 10510168583516
Offset: 0

Views

Author

Keywords

References

  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Extensions

Edited and extended by Joseph Myers, Jul 21 2013
a(12)-a(13) from Sean A. Irvine, Nov 13 2017
a(14)-a(15) from Bert Dobbelaere, Jan 12 2019

A001397 Number of 2n-step self-avoiding walks on diamond lattice ending at point with x = 2.

Original entry on oeis.org

4, 24, 188, 1368, 10572, 81376, 637148, 5007560, 39638728, 314980912, 2513038452, 20109809792, 161359033480, 1297640775272, 10456351280264
Offset: 1

Views

Author

Keywords

References

  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Extensions

Edited and extended by Joseph Myers, Jul 21 2013
a(12)-a(14) from Sean A. Irvine, Nov 16 2017
a(15) from Bert Dobbelaere, Jan 12 2019

A001398 Number of (2n+1)-step self-avoiding walks on diamond lattice ending at point with x = 3.

Original entry on oeis.org

8, 56, 464, 3520, 27768, 217316, 1719616, 13633972, 108620060, 867750412, 6952901716, 55838915036, 449398552664, 3623393504692, 29262315259524
Offset: 1

Views

Author

Keywords

References

  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Extensions

Edited and extended by Joseph Myers, Jul 21 2013
a(12)-a(13) from Sean A. Irvine, Nov 19 2017
a(14)-a(15) from Bert Dobbelaere, Jan 12 2019

A038515 Number of self-avoiding walks on a tetrahedral (diamond) net, having 2n steps and forming a closed loop.

Original entry on oeis.org

1, 0, 0, 6, 12, 120, 564, 4074, 25008, 174618, 1181100, 8358306, 59167872, 427081512, 3103408308, 22797207330, 168616517760, 1256350493196
Offset: 0

Views

Author

Keywords

Crossrefs

Extensions

a(0)=1 and a(9)-a(15) from Sean A. Irvine, Jan 16 2021
a(16)-a(17) using the data from Guttmann & Jensen added by Andrey Zabolotskiy, Jun 02 2022

A334602 Number of self-avoiding walks on a 2-dimensional square lattice where the walk consists of steps of length 1 to n which can be taken in any order.

Original entry on oeis.org

1, 4, 24, 216, 2544, 36832, 632736, 12566016, 283849872, 7179191888, 200946557168, 6165203252096
Offset: 0

Views

Author

Scott R. Shannon, May 07 2020

Keywords

Comments

This sequence gives the number of self-avoiding walks on a 2-dimensional square lattice where the walk consists of steps of length 1 to n which can be taken in any order. Walks which visit the same lattice coordinates but are done so by taking steps of the same length in different order are considered to be different walks. For example a walk consisting of steps with length 1 and 2 to the right is counted as a different walk to one with step lengths 2 and 1 to the right.
The first time a collision with a previous step can occur is for n = 4. If we only consider the first step being taken to the right then there are six ways this can occur. These are 2R->3U->1L->4D, 3R->1U->2L->4D, 3R->2U->1L->4D, 4R->1U->2L->3D, 4R->1U->3L->2D, 4R->2U->1L->3D, where the number is the step length and R,L,U,D are directions right,left,up and down from the origin.

Examples

			a(1) = 4. These are the four directions one can step 1 unit away from the origin on a 2D square lattice.
a(2) = 24. These consist of the following four walks:
.
    *
    |             *        1     2            2     1
    . 2           | 1    *---*---.---*    *---.---*---*
    |     *---.---*
*---*         2
  1
.
The first two can be walked in eight different ways on a 2D lattice, the last two in four different ways, giving a total of 2*8+2*4 = 24.
a(3) = 216. Restricting the first step to the right then the different ways a walk can take three steps on a 2D lattice within the first quadrant are RUL, RUU, RUR, RRU, RRR. Each of these can be taken in 6 ways, the arrangements of 1,2,3. The first four walks can also be taken in eight ways on the 2D lattice, the last in four ways, giving a total of 4*8*3!+1*4*3! = 216.
a(4) = 2544. Restricting the first step to the right then the different ways a walk can take four steps on a 2D lattice within the first quadrant are RULD, RULL, RULU, RUUL, RUUU, RUUR, RURU, RURR, RURD, RRUL, RRUU, RRUR, RRRU, RRRR. Each of these can be taken in 24 ways, the arrangements of 1,2,3,4. However six of these walks are forbidden due to the collisions given in the comments. The first thirteen walks can also be taken in eight ways on the 2D lattice, the fourteenth in four ways. This gives a total number of walks of 13*8*4! - 6*8 + 4*4! = 2544.
		

Crossrefs

Showing 1-10 of 10 results.