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-2 of 2 results.

A038373 Number of n-step self-avoiding paths on quadrant grid starting at quadrant origin.

Original entry on oeis.org

1, 2, 4, 10, 24, 60, 146, 366, 912, 2302, 5800, 14722, 37368, 95304, 243168, 622518, 1594622, 4094768, 10521384, 27085436, 69768478, 179982688, 464564220, 1200563864, 3104192722, 8034256412, 20803994184, 53915334890, 139785953076, 362681515714, 941361260956, 2444866458524, 6351963691964
Offset: 0

Views

Author

Keywords

Crossrefs

Formula

a(n) = 2 * A046170(n) for n >= 1. - Siqi Wang, Jul 15 2022

Extensions

a(25)-a(32) from Bert Dobbelaere, Jan 05 2019

A046171 Number of inequivalent self-avoiding walks of length n on a 2-D lattice which start at origin, take first step in {+1,0} direction and if any steps are vertical, a step up is taken before a step down.

Original entry on oeis.org

1, 2, 5, 13, 36, 98, 272, 740, 2034, 5513, 15037, 40617, 110188, 296806, 802075, 2155667, 5808335, 15582342, 41889578, 112212146, 301100754, 805570061, 2158326727, 5768299665, 15435169364, 41214098278, 110164686454
Offset: 1

Views

Author

Keywords

Crossrefs

Formula

a(n) = (A001411(n)+4)/8.

Extensions

More terms from Stephen A. Silver
Showing 1-2 of 2 results.