Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A001334

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Number of n-step self-avoiding walks on hexagonal [ =triangular ] lattice.
(history; published version)
#65 by Michel Marcus at Thu May 13 11:30:15 EDT 2021
STATUS

reviewed

approved

#64 by Joerg Arndt at Thu May 13 10:24:28 EDT 2021
STATUS

proposed

reviewed

#63 by F. Chapoton at Thu May 13 08:39:57 EDT 2021
STATUS

editing

proposed

#62 by F. Chapoton at Thu May 13 08:39:49 EDT 2021
PROG

... M=[y for y in L]; M.append(x)

... return(M)

... 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))

STATUS

approved

editing

Discussion
Thu May 13
08:39
F. Chapoton: copy-pastable py code
#61 by Michel Marcus at Sun Dec 30 03:45:06 EST 2018
STATUS

reviewed

approved

#60 by Joerg Arndt at Sun Dec 30 03:37:07 EST 2018
STATUS

proposed

reviewed

#59 by Michel Marcus at Sat Dec 29 16:53:36 EST 2018
STATUS

editing

proposed

#58 by Michel Marcus at Sat Dec 29 16:50:23 EST 2018
REFERENCES

D. C. Rapaport, J. Phys. A 18 (1985), L201.

LINKS

D. C. Rapaport, <a href="https://doi.org/10.1088/0305-4470/18/4/003">End-to-end distance of linear polymers in two dimensions: a reassessment</a>, J. Phys. A 18 (1985), L201.

STATUS

proposed

editing

#57 by Andrey Zabolotskiy at Sat Dec 29 15:58:15 EST 2018
STATUS

editing

proposed

#56 by Andrey Zabolotskiy at Sat Dec 29 15:58:10 EST 2018