The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A308409 Number of bond trees with n bonds on the square lattice. 1
1, 2, 6, 22, 87, 364, 1574, 6986, 31581, 144880, 672390, 3150362, 14877317, 70726936, 338158676 (list; graph; refs; listen; history; text; internal format)



a(n-1) is the number of bond trees with n sites (vertices) on the square lattice.

a(n) is the number of fixed polyedges (A096267) with n edges and no cycles.


Table of n, a(n) for n=0..14.

D. S. Gaunt et al., Universality in branched polymers on d-dimensional hypercubic lattices, Journal of Physics A: Mathematical and General 15.10 (1982): 3209.

Douglas A. Torrance, Enumeration of planar Tangles, arXiv:1906.01541 [math.CO], 2019. See Table 4.1 (A).

S. G. Whittington, G. M. Torrie, and D. S. Gaunt, Branched polymers with a prescribed number of cycles, Journal of Physics A: Mathematical and General 16.8 (1983): 1695.


Sequence in context: A164651 A279566 A150261 * A150262 A101043 A101046

Adjacent sequences:  A308406 A308407 A308408 * A308410 A308411 A308412




Douglas A. Torrance, May 25 2019



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 29 23:27 EST 2020. Contains 338780 sequences. (Running on oeis4.)