0,2

The sequence (origin 1) is the resistance between opposite corners of an n-dimensional hypercube of unit resistors, multiplied by n!.

The resistances for n = 1,2,3,... are 1 1 5/6 2/3 8/15 13/30 151/420 32/105 83/315 73/315 1433/6930 ...

Number of {12,21*,2*1}-avoiding signed permutations in the hyperoctahedral group.

a(n) is the sum of the reciprocals of the binomial coefficients C(n,k), multiplied by n!; example : a(4) = 4!*(1/1 + 1/4 + 1/6 + 1/4 + 1/1) = 64 . - Philippe DELEHAM, May 12 2005

a(n) = number of permutations on [n+1] that avoid the pattern 13-2|. The absence of a dash between 1 and 3 means the "1" and "3" must be consecutive in the permutation; the vertical bar means the "2" must occur at the end of the permutation. For example, 24153 fails to avoid this pattern: 243 is an offending subpermutation. - David Callan (callan(AT)stat.wisc.edu), Nov 02 2005

n!/A003149(n) is the probability that a random walk on an (n+1)-dimensional hypercube will visit the diagonally opposite vertex before it returns to its starting point. 2^n*A003149(n)/n! is the expected length of a random walk from one vertex of an (n+1)-dimensional hypercube to the diagonally opposite vertex (a walk which may include one or more passes through the starting point). These "random walk" examples are solutions to IBM's "Ponder This" puzzle for April, 2006 - Graeme McRae (g_m(AT)mcraefamily.com), Apr 02 2006

a(n) = number of strong fixed points in all permutations of {1,2,...,n+1} (a permutation p of {1,2,...,n} is said to have j as a strong fixed point (splitter) if p(k)<j for k<j and p(k)>j for k>j). Example: a(2)=5 because the permutations of {1,2,3}, with marked strong fixed points, are: 1'2'3', 1'32, 312, 213', 231 and 321. [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 28 2008]

Author?, Resistances in the multidimensional cube, Quantum 7:1 (1996) 12-15 and 63.

Problem E3467, Amer. Math. Monthly, 100 (1993), 800-801. [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 28 2008]

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

Stanley, R. P., Enumerative Combinatorics, Volume 1 (1986), p. 49. [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 28 2008]

B. Sury, Sum of the reciprocals of the binomial coefficients, Europ. J. Comb., 14 (1993), 351-353.

T. D. Noe, Table of n, a(n) for n=0..100

Fred Curtis, Resistance-network Problems.

IBM, "Ponder This" puzzle for April, 2006

T. Mansour and J. West, Avoiding 2-letter signed patterns.

Leroy Quet, Home Page (listed in lieu of email address)

V. Strehl, The average number of splitters in a random permutation [Unpublished; included here with the author's permission.]

a(n) = n!+((n+1)/2)a(n-1), n >= 1. - Leroy Quet, Sep 06 2002

a(n) = ((3n+1)/2)a(n-1)-(m^2/2)a(m-2), n >= 2. - David W. Wilson, Sep 06, 2002

G.f.: (Sum_{k>=0} k!*x^k)^2. - Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 30 2002

E.g.f: log(1-x)/(x/2-1) if offset 1.

Convolution of A000142 [factorial numbers] with itself - Ross La Haye (rlahaye(AT)new.rr.com), Oct 29 2004

a(n)=Sum(k*A145878(n+1,k),k=0..n+1). [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 28 2008]

a(n)=A084938(n+2,2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Dec 17 2008]

(PARI) a(n)=sum(k=0, n, k!*(n-k)!)

(PARI) a(n)=if(n<0, 0, (n+1)!*polcoeff(log(1-x+x^2*O(x^n))/(x/2-1), n+1))

Cf. A046825, A046878, A046879.

A052186, A006932, A145878 [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 28 2008]

Sequence in context: A000112 A127083 A131178 this_sequence A027046 A000522 A007469

Adjacent sequences: A003146 A003147 A003148 this_sequence A003150 A003151 A003152

nonn,easy,nice

N. J. A. Sloane (njas(AT)research.att.com), H. W. Gould

More terms from Michel ten Voorde (seqfan(AT)tenvoorde.org) Apr 11 2001

Additional comments from Michael Somos, Feb 14, 2002