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.

A001334 Number of n-step self-avoiding walks on hexagonal [ =triangular ] lattice.

Original entry on oeis.org

1, 6, 30, 138, 618, 2730, 11946, 51882, 224130, 964134, 4133166, 17668938, 75355206, 320734686, 1362791250, 5781765582, 24497330322, 103673967882, 438296739594, 1851231376374, 7812439620678, 32944292555934, 138825972053046
Offset: 0

Views

Author

Keywords

Comments

The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.

References

  • A. J. Guttmann, Asymptotic analysis of power-series expansions, pp. 1-234 of C. Domb and J. L. Lebowitz, editors, Phase Transitions and Critical Phenomena. Vol. 13, Academic Press, NY, 1989.
  • B. D. Hughes, Random Walks and Random Environments, Oxford 1995, vol. 1, p. 459.
  • 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

Programs

  • Mathematica
    mo={{2, 0},{-1, 1},{-1, -1},{-2, 0},{1, -1},{1, 1}}; a[0]=1;
    a[tg_, p_:{{0, 0}}] := Block[{e, mv = Complement[Last[p]+# & /@ mo, p]}, If[tg == 1, Length@mv, Sum[a[tg-1, Append[p, e]], {e, mv}]]];
    a /@ Range[0, 6]
    (* Robert FERREOL, Nov 28 2018; after the program of Giovanni Resta in A001411 *)
  • Python
    def add(L,x):
        M=[y for y in L];M.append(x)
        return(M)
    plus=lambda L,M : [x+y for x,y in zip(L,M)]
    mo=[[2,0],[-1,1],[-1, -1],[-2,0],[1,-1],[1, 1]]
    def a(n,P=[[0, 0]]):
        if n==0: return(1)
        mv1 = [plus(P[-1],x) for x in mo]
        mv2=[x for x in mv1 if x not in P]
        if n==1: return(len(mv2))
        else: return(sum(a(n-1,add(P,x)) for x in mv2))
    [a(n) for n in range(11)]
    # Robert FERREOL, Dec 11 2018

A003289 Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (0,1).

Original entry on oeis.org

1, 2, 4, 10, 30, 98, 328, 1140, 4040, 14542, 53060, 195624, 727790, 2728450, 10296720, 39084190, 149115456, 571504686, 2199310460, 8494701152, 32919635606, 127961125094, 498775164568, 1949112527750, 7634623480172
Offset: 1

Views

Author

Keywords

Comments

The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.

References

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

Crossrefs

Equals A001335(n+1) / 6 for n > 1.

Extensions

More terms and title improved by Sean A. Irvine, Feb 13 2016
a(23)-a(24) from Bert Dobbelaere, Jan 03 2019
a(25) from Bert Dobbelaere, Jan 15 2019

A003290 Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (0,2).

Original entry on oeis.org

1, 6, 18, 50, 156, 508, 1724, 6018, 21440, 77632, 284706, 1055162, 3944956, 14858934, 56325420, 214698578, 822373244, 3163606784, 12217121138, 47343356398, 184038696776, 717456797490, 2804219712064, 10986639618642
Offset: 2

Views

Author

Keywords

Comments

The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.

References

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

Crossrefs

Extensions

More terms and title improved by Sean A. Irvine, Feb 13 2016
a(23)-a(25) from Bert Dobbelaere, Jan 15 2019

A003291 Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (1,1).

Original entry on oeis.org

2, 6, 16, 46, 140, 464, 1580, 5538, 19804, 71884, 264204, 980778, 3671652, 13843808, 52519836, 200320878, 767688176, 2954410484, 11412815256, 44237340702, 171997272012, 670612394118, 2621415708492, 10271274034254
Offset: 2

Views

Author

Keywords

Comments

The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.

References

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

Crossrefs

Extensions

More terms and title improved by Sean A. Irvine, Feb 14 2016
a(23)-a(25) from Bert Dobbelaere, Jan 15 2019

A005549 Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (0,3).

Original entry on oeis.org

1, 12, 54, 188, 636, 2168, 7556, 26826, 96724, 353390, 1305126, 4864450, 18272804, 69103526, 262871644, 1005137688, 3860909698, 14890903690, 57641869140, 223864731680, 872028568182, 3406103773674, 13337263822236
Offset: 3

Views

Author

Keywords

Comments

The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.

References

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

Crossrefs

Extensions

More terms and improved title from Sean A. Irvine, Feb 14 2016
a(23)-a(25) from Bert Dobbelaere, Jan 15 2019

A005550 Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (1,2).

Original entry on oeis.org

3, 16, 57, 184, 601, 2036, 7072, 25088, 90503, 330836, 1222783, 4561058, 17145990, 64888020, 246995400, 944986464, 3631770111, 14013725268, 54268946152, 210842757798, 821569514032, 3209925357702, 12572219405144
Offset: 3

Views

Author

Keywords

Comments

The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.

References

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

Crossrefs

Extensions

More terms and title improved by Sean A. Irvine, Feb 15 2016
a(23)-a(25) from Bert Dobbelaere, Jan 15 2019

A005551 Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (0,4).

Original entry on oeis.org

1, 20, 130, 576, 2218, 8170, 29830, 109192, 402258, 1492746, 5578742, 20986424, 79420122, 302175648, 1155298598, 4436375790, 17103294308, 66174208076, 256870951048, 1000080994758, 3904276709604, 15280413966512
Offset: 4

Views

Author

Keywords

Comments

The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.

References

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

Crossrefs

Extensions

More terms and improved title from Sean A. Irvine, Feb 14 2016
a(23)-a(25) from Bert Dobbelaere, Jan 15 2019

A005552 Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (1,3).

Original entry on oeis.org

4, 35, 166, 633, 2276, 8107, 29086, 105460, 386320, 1428664, 5327738, 20014741, 75677726, 287784832, 1099944240, 4223170456, 16280541834, 62992268833, 244536402984, 952154191644, 3717618386556, 14551788319328
Offset: 4

Views

Author

Keywords

Comments

The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.

References

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

Crossrefs

Extensions

More terms and title improved by Sean A. Irvine, Feb 15 2016
a(23)-a(25) from Bert Dobbelaere, Jan 15 2019

A005553 Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (2,2).

Original entry on oeis.org

6, 40, 174, 644, 2268, 8020, 28666, 103696, 379450, 1402276, 5227366, 19633732, 74230146, 282273744, 1078902168, 4142578832, 15970882784, 61798680076, 239921541412, 934258870200, 3648030627298, 14280474288676
Offset: 4

Views

Author

Keywords

Comments

The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.

References

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

Crossrefs

Extensions

More terms and title improved by Sean A. Irvine, Feb 15 2016
a(23)-a(25) from Bert Dobbelaere, Jan 15 2019

A005396 Number of 2n-step polygons on honeycomb.

Original entry on oeis.org

1, 0, 0, 6, 0, 30, 24, 168, 288, 1170, 2760, 9504, 25776, 84006, 244104, 779970, 2356800, 7487310, 23167656, 73639326, 231348000, 737718534, 2341772136, 7498417956, 23982456384, 77119604400, 248088123192, 800978437674, 2588744704560, 8388692108016, 27217694697000
Offset: 2

Views

Author

Keywords

References

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

Crossrefs

Cf. A001335.

Formula

a(n) = 2 * n * A006774(n), n > 1. - Sean A. Irvine, Aug 06 2020

Extensions

a(11)-a(21) from Sean A. Irvine, Jun 12 2016
a(0)-a(1) inserted and more terms from Sean A. Irvine, Aug 06 2020
Showing 1-10 of 10 results.