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.

A047057 Number of configurations of linear chains in a cubic lattice.

Original entry on oeis.org

0, 0, 24, 192, 1032, 5376, 26688, 128880, 605664, 2802576, 12755136, 57525552, 256574352, 1137418464, 5001796944, 21899428128, 95296531680, 413331190896
Offset: 1

Views

Author

Keywords

Comments

From Petros Hadjicostas, Jan 04 2019: (Start)
In the notation of Nemirovsky et al. (1992), a(n), the n-th term of the current sequence is C_{n,m} with m=1 (and d=3). Here, for a d-dimensional hypercubic lattice, C_{n,m} is "the number of configurations of an n-bond self-avoiding chain with m neighbor contacts." (For d=2, we have C_{n,m=1} = A033155(n).)
These numbers are given in Table I (p. 1088) in the paper by Nemirovsky et al. (1992). Using Eqs. (5) and (7b) in the paper, we can prove that C_{n,m=1} = 2^1*1!*Bin(3,1)*p_{n,m=1}^{(1)} + 2^2*2!*Bin(3,2)*p_{n,m=1}^{(2)} + 2^3*3!*Bin(3,3)*p_{n,m=1}^{(3)} = 0 + 24*p_{n,m=1}^{(2)} + 48*p_{n,m=1}^{(3)} = 24*A038747(n) + 48*A038749(n).
For an explanation of the meaning of p_{n,m}^{(l)} (l = 1,2,3,...), see the discussion that follows Eq. (5) in Nemirovsky et al. (1992), pp. 1090-1093. See also the comments for sequence A038748 by Bert Dobbelaere. (End)

Crossrefs

Formula

a(n) = 24*A038747(n) + 48*A038749(n) for n >= 1. - Petros Hadjicostas, Jan 04 2019

Extensions

Name edited by Petros Hadjicostas, Jan 04 2019
a(12)-a(18) from Sean A. Irvine, Jan 31 2021

A038747 Coefficients arising in the enumeration of configurations of linear chains.

Original entry on oeis.org

0, 0, 1, 4, 11, 32, 92, 254, 672, 1778, 4622, 11938, 30442, 77396, 194896, 489620, 1221134, 3040194, 7524933, 18600478, 45756483, 112444948, 275204606, 673031750, 1640168584, 3994716336, 9699476314
Offset: 1

Views

Author

N. J. A. Sloane, May 02 2000

Keywords

Comments

In the notation of Nemirovsky et al. (1992), a(n), the n-th term of this sequence is p_{n,m}^{(l)} with m=1 and l=2. These numbers are given in Table II (p. 1093) in the paper. This sequence can be used for the calculation of sequence A033155(n) via Eq. (5) in the paper by Nemirovsky et al. (1992). (Note that, by equations (7b) in the paper, p_{n,1}^{(1)} = 0 for all n >= 1.) - Petros Hadjicostas, Jan 03 2019
In Table B1 (pp. 4738-4739), Bennett-Wood et al. (1998) tabulated c_n(k)/4, for various values of n and k, where c_n(k) is "the number of SAWs of length n with k nearest-neighbour contacts". (Here, the letter k stands for the letter m in the previous paragraph.) Bennett-Wood et al. (1998) worked only with a square lattice (i.e., d=2) unlike Nemirovsky et al. (1992) who worked with a d-dimensional hypercubic lattice. Both papers deal with SAWs = self-avoiding walks (in a lattice). We have c_n(k=1) = A033155(n) = 8*p_{n,1}^{(2)}, i.e., a(n) = p_{n,1}^{(2)} = (c_n(k=1)/4)/2, and this is the reason the numbers in Table B1 in Bennett-Wood et al. (1998) must be divided by 2 in order to get extra terms for the current sequence (a(12) to a(24)). - Petros Hadjicostas, Jan 05 2019

Crossrefs

Extensions

The first two 0's in the sequence were inserted by Petros Hadjicostas, Jan 03 2019 to make it agree with Table II (p. 1093) and Eq. (5) (p. 1090) in the paper by Nemirovsky et al. (1992)
Terms a(12) to a(24) were copied from Table II, p. 4738, in the paper by Bennett-Wood et al. (1998) (after division by 2) by Petros Hadjicostas, Jan 05 2019
a(25)-a(27) from Sean A. Irvine, Jul 03 2020
Showing 1-2 of 2 results.