0,3

Number of edges in an n-dimensional hypercube.

Number of 132-avoiding permutations of [n+2] containing exactly one 123 pattern. - Emeric Deutsch, Jul 13 2001

Number of ways to place n-1 nonattacking kings on a 2 X 2(n-1) chessboard for n >= 2. - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), May 22 2001

Arithmetic derivative of 2^n: a(n) = A003415(A000079(n)). - Reinhard Zumkeller, Feb 26 2002

(-1) times determinant of matrix A_{i,j} = -|i-j|, 0<=i,j<=n.

a(n) = number of ones in binary numbers 1 to 111...1 (n bits). a(n) = A000337(n)-A000337(n-1) for n = 2,3,... . - Emeric Deutsch, May 24 2003

The number of 2 X n 0-1 matrices containing n+1 1's and having no zero row or column. The number of spanning trees of the complete bipartite graph K(2,n). This is the case m = 2 of K(m,n). See A072590. - W. Edwin Clark, May 27 2003

Binomial transform of [0,1,2,3,4,5,...]. Without the initial 0, binomial transform of odd numbers.

With an additional leading zero, [0,0,1,4,...] this is the binomial transform of the integers repeated A004526. Its formula is then (2^n(n-1)+0^n)/4. - Paul Barry, May 20 2003

Number of zeros in all different (n+1)-bit integers. - Ralf Stephan, Aug 02 2003

Final element of a summation table (as opposed to a difference table) whose first row consists of integers 0 through n (or first n+1 nonnegative integers A001477); illustrating the case n=5:

0...1...2...3...4...5

..1...3...5...7...9

....4...8...12..16

......12..20..28

........32..48

..........80 and final element is a(5)=80. - Lekraj Beedassy, Jun 03 2004

This sequence and A001871 arise in counting ordered trees of height at most k where only the right-most branch at the root actually achieves this height and the count is by the number of edges, with k = 3 for this sequence and k = 4 for A001871.

Let R be a binary relation on the power set P(A) of a set A having n = |A| elements such that for all elements x,y of P(A), xRy if x is a proper subset of y and there are no z in P(A) such that x is a proper subset of z and z is a proper subset of y. Then a(n) = |R|. - Ross La Haye, Sep 21 2004

Number of 2 X n binary matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1) and (10;1). An occurrence of a ranpp (xy;z) in a matrix A=(a(i,j)) is a triple (a(i1,j1), a(i1,j2), a(i2,j1)) where i1<i2, j1<j2 and these elements are in same relative order as those in the triple (x,y,z). - Sergey Kitaev (kitaev(AT)ms.uky.edu), Nov 11 2004

Number of subsequences 00 in all binary words of length n+1. Example: a(2)=4 because in 000,001,010,011,100,101,110,111 the sequence 00 occurs 4 times. - Emeric Deutsch, Apr 04 2005

If you expand the n-factor expression (a+1)(b+1)(c+1)...(z+1), there are a(n) variables in the result. For example, the 3-factor expression (a+1)(b+1)(c+1) expands to abc+ab+ac+bc+a+b+c+1 with a(3) = 12 variables. - David W. Wilson, May 08 2005

An inverse Chebyshev transform of n^2, where g(x)->(1/sqrt(1-4*x^2))*g(x*c(x^2)), c(x) the g.f. of A000108. - Paul Barry, May 13 2005

Sequences A018215 and A058962 interleaved. - Graeme McRae, Jul 12 2006

The number of never-decreasing positive integer sequences of length n with a maximum value of 2*n. - Ben Paul Thurston, Nov 13 2006

Total size of all the subsets of an n-element set. For example, a 2-element set has 1 subset of size 0, 2 subsets of size 1 and 1 of size 2. - Ross La Haye, Dec 30 2006

Convolution of the natural numbers [A000027] and A045623 beginning [0,1,2,5...]. - Ross La Haye, Feb 03 2007

If M is the matrix (given by rows) [2,-1;0,2] then the sequence gives the (1,2) entry in M^n. - Antonio M. Oller-Marcén, May 21 2007

If X_1,X_2,...,X_n is a partition of a 2n-set X into 2-blocks then, for n>0, a(n) is equal to the number of (n+1)-subsets of X intersecting each X_i (i=1,2,...,n). - Milan Janjic, Jul 21 2007

Number of n-permutations of 3 objects u,v,w, with repetition allowed, containing exactly one u. Example: a(2)=4 because we have uv, vu, uw and wu. - Zerinvary Lajos, Dec 27 2007

A member of the family of sequences defined by a(n) = n*[c(1)*...c(r)]^(n-1); c(i) integer. This sequence has c(1)=2, A027471 has c(1)=3. - Ctibor O. Zizka, Feb 23 2008

a(n) is the number of ways to split {1,2,...n-1} into two (possibly empty) complementary intervals {1,2,...i} and {i+1,i+2,...n-1} and then select a subset from each interval. - Geoffrey Critzer, Jan 31 2009

Sum(n>0, 1/a(n)) = 2*log(2). - Jaume Oliver Lafont, Feb 10 2009]

Equals the Jacobsthal sequence A001045 convolved with A003945: (1, 3, 6, 12,...). - Gary W. Adamson, May 23 2009

Starting with offset 1 = A059570: (1, 2, 6, 14, 34,...) convolved with (1, 2, 2, 2,...). - Gary W. Adamson, May 23 2009

Equals the first left hand column of A167591. - Johannes W. Meijer, Nov 12 2009

a(n) = A000788(A000225(n)) = A173921(A000225(n)). - Reinhard Zumkeller, Mar 04 2010

The number of tatami tilings of an n X n square with n monomers is n*2^{n-1}. - Frank Ruskey, Sep 25 2010

Under T. D. Noe's variant of the hypersigma function, this sequence gives hypersigma(2^n): a(n) = A191161(A000079(n)). - Alonso del Arte, Nov 04 2011

Number of Dyck (n+2)-paths with exactly one valley at height 1 and no higher valley. - David Scambler, Nov 07 2011

Equals triangle A059260 * A016777 as a vector, where A016777 = (3n + 1): [1, 4, 7, 10, 13,...]. - Gary W. Adamson, Mar 06 2012

Main transitions in systems of n particles with spin 1/2 (see A212697 with b=2). - Stanislav Sykora, May 25 2012

Let T(n,k) be the triangle with (first column) T(n,1)=2*n-1 for n>=1, otherwise T(n,k) = T(n,k-1) + T(n-1,k-1), then a(n) = T(n,n). - J. M. Bergot, Jan 17 2013

Sum of all parts of all compositions (ordered partitions) of n. The equivalent sequence for partitions is A066186. - Omar E. Pol, Aug 28 2013

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 796.

A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, id. 131.

H. J. Brothers, Pascal's Prism: Supplementary Material, http://www.brotherstechnology.com/docs/Pascal's_Prism_(supplement).pdf.

M. Elkadi and B. Mourrain, Symbolic-numeric methods for solving polynomial equations and applications, Chap 3. of A. Dickenstein and I. Z. Emiris, eds., Solving Polynomial Equations, Springer, 2005, pp. 126-168. See p. 152.

A. Erickson, F. Ruskey, M. Schurch and J. Woodcock, Auspicious Tatami Mat Arrangements, in The 16th Annual International Computing and Combinatorics Conference (COCOON 2010), July 19-21, Nha Trang, Vietnam. Lecture Notes in Computer Science (LNCS) 6196 (2010) 288-297.

F. A. Haight, Overflow at a traffic light, Biometrika, 46 (1959), 420-424.

A. F. Horadam, Special properties of the sequence W_n(a,b; p,q), Fib. Quart., 5.5 (1967), 424-434. Case n->n+1, a=0,b=1; p=4, q=-4.

Jones, C. W.; Miller, J. C. P.; Conn, J. F. C.; Pankhurst, R. C.; Tables of Chebyshev polynomials. Proc. Roy. Soc. Edinburgh. Sect. A. 62, (1946). 187-203.

Ross La Haye, Binary Relations on the Power Set of an n-Element Set, Journal of Integer Sequences, Vol. 12 (2009), Article 09.2.6.

T. Y. Lam, On the diagonalization of quadratic forms, Math. Mag., 72 (1999), 231-235 (see page 234).

W. Lang, On polynomials related to powers of the generating function of Catalan's numbers, Fib. Quart. 38,5 (2000) 408-419; Eqs. (38) and (45), lhs, m=4.

Dusko Letic, Nenad Cakic, Branko Davidovic, Ivana Berkovic and Eleonora Desnica, Some certain properties of the generalized hypercubical functions, Advances in Difference Equations, 2011, 2011:60; http://www.advancesindifferenceequations.com/content/pdf/1687-1847-2011-60.pdf.

Clifford A. Pickover, The Math Book, From Pythagoras to the 57th Dimension, 250 Milestones in the History of Mathematics, Sterling Publ., NY, 2009, page 282.

A. Robertson, Permutations containing and avoiding 123 and 132 patterns, Discrete Math. and Theoret. Computer Sci., 3 (1999), 151-154.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

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

Franklin T. Adams-Watters, Table of n, a(n) for n = 0..500

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].

D. W. Bass and I. H. Sudborough, Hamilton decompositions and (n/2)-factorizations of hypercubes, J Graph Algor. Appl. 7(2003) 79-98.

D. Callan, A recursive bijective approach to counting permutations...

P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.

F. Ellermann, Illustration of binomial transforms

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 408

Milan Janjic, Two Enumerative Functions

M. Janjic and B. Petkovic, A Counting Function, arXiv preprint arXiv:1301.4550, 2013

S. Kitaev, On multi-avoidance of right angled numbered polyomino patterns, Integers: Electronic Journal of Combinatorial Number Theory 4 (2004), A21, 20pp.

S. Kitaev, On multi-avoidance of right angled numbered polyomino patterns, University of Kentucky Research Reports (2004).

S. Kitaev, J. Remmel and M. Tiefenbruck, Marked mesh patterns in 132-avoiding permutations I, Arxiv preprint arXiv:1201.6243, 2012.

Dusko Letic, Nenad Cakic, Branko Davidovic, Ivana Berkovic and Eleonora Desnica, Some certain properties of the generalized hypercubical functions, Advances in Difference Equations, 2011, 2011:60.

Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992.

Simon Plouffe, 1031 Generating Functions and Conjectures, Université du Québec à Montréal, 1992.

A. Robertson, Permutations containing and avoiding 123 and 132 patterns

A. Robertson, H. S. Wilf and D. Zeilberger, Permutation patterns and continued fractions, Electr. J. Combin. 6, 1999, #R38.

Eric Weisstein's World of Mathematics, Hypercube

Eric Weisstein's World of Mathematics, Leibniz Harmonic Triangle

Thomas Wieder, The number of certain k-combinations of an n-set, Applied Mathematics Electronic Notes, vol. 8 (2008).

Index entries for sequences related to Chebyshev polynomials.

Index entries for sequences related to linear recurrences with constant coefficients,  signature (4,-4).

a(n) = sum(k=1, n, k*binomial(n, k)). - Benoit Cloitre, Dec 06 2002

E.g.f.: x*exp(2x). - Paul Barry, Apr 10 2003

G.f.: x/(1-2*x)^2.

G.f.: x / (1 - 4*x / (1 + x / (1 - x))). - Michael Somos, Apr 07 2012

A108666(n) = Sum_{k=0, n} binomial(n, k)^2 * a(n). - Michael Somos, Apr 07 2012

PSumSIGN transform of A053220. PSumSIGN transform is A045883. Binomial transform is A027471(n+1). - Michael Somos, Jul 10 2003

Starting at a(1)=1, INVERT transform is A002450, INVERT transform of A049072, MOBIUS transform of A083413, PSUM transform is A000337, BINOMIAL transform is A081038, BINOMIAL transform of A005408. - Michael Somos, Apr 07 2012

a(n) = 2*a(n-1)+2^(n-1).

a(2*n) = n*4^n, a(2*n+1) = (2*n+1)4^n.

G.f.: x/det(I-x*M) where M=[1,i;i,1], i=sqrt(-1). - Paul Barry, Apr 27 2005

Starting 1, 1, 4, 12, .. this is 0^n + n2^(n-1), the binomial transform of the 'pair-reversed' natural numbers A004442. - Paul Barry, Jul 24 2003

Convolution of [1, 2, 4, 8, ...] with itself. - Jon Perry, Aug 07 2003

The signed version of this sequence, n(-2)^(n-1), is the inverse binomial transform of n(-1)^(n-1) (alternating sign natural numbers). - Paul Barry, Aug 20 2003

a(n-1) = sum{k=0..n, 2^(n-k-1)*C(n-k, k)*C(1,(k+1)/2)*(1-(-1)^k)/2}-0^n/4. - Paul Barry, Oct 15 2004

a(n)=sum{k=0..floor(n/2), binomial(n, k)(n-2k)^2}. - Paul Barry, May 13 2005

a(n+2) = A049611(n+2) - A001788(n).

a(n) = n! * sum{k=0..n, 1/((k - 1)!(n - k)!)}. - Paul Barry, Mar 26 2003

a(n+1) = Sum_{k, 0<=k<=n} 4^k * A109466(n,k). - Philippe Deléham, Nov 13 2006

Row sums of A130300 starting (1, 4, 12, 32,...). - Gary W. Adamson, May 20 2007

Equals row sums of triangle A134083. Equals A002064(n) + (2^n - 1). - Gary W. Adamson, Oct 07 2007

a(n) = 4*a(n-1) - 4*a(n-2), a(0)=0, a(1)=1. - Philippe Deléham, Nov 16 2008

a(n) = n * A011782(n). - Omar E. Pol, Aug 28 2013

a(n-1) = sum(t_1+2*t_2+...+n*t_n=n, (t_1+t_2 +...+t_n-1)*multinomial(t_1+t_2 +...+t_n,t_1,t_2,...,t_n)). - Mircea Merca, Dec 06 2013

sum{k>=1, 1/a(k)} = 2*log(2). - Jaume Oliver Lafont, Mar 28 2014

a(n+1) = sum( (2*r+1)*C(n,r), r=0..n ). - J. M. Bergot, Apr 07 2014

a(2)=4 since 2314, 2341,3124 and 4123 are the only 132-avoiding permutations of 1234 containing exactly one increasing subsequence of length 3.

x + 4*x^2 + 12*x^3 + 32*x^4 + 80*x^5 + 192*x^6 + 448*x^7 + ...

spec := [S, {B=Set(Z, 0 <= card), S=Prod(Z, B, B)}, labeled]: seq(combstruct[count](spec, size=n), n=0..29); # Zerinvary Lajos, Oct 09 2006

A001787:=1/(2*z-1)^2; # Simon Plouffe in his 1992 dissertation, dropping the initial zero

Table[Sum[Binomial[n, i] i, {i, 0, n}], {n, 0, 30}] (* Geoffrey Critzer, Mar 18 2009 *)

f[n_]:=n*2^(n-1); f[Range[0, 40]] (* Vladimir Joseph Stephan Orlovsky, Feb 09 2011 *)

Array[# 2^(#-1)&, 40, 0] (* Harvey P. Dale, Jul 26 2011 *)

(PARI) {a(n) = if( n<0, 0, n * 2^(n-1))}

Partial sums of A001792. Cf. A053109, A001788, A001789. A058922(n+1) = 4*A001787(n).

Row sums of triangle in A003506. Equals A090802(n, 1).

Cf. A000337, A130300, A134083, A002064.

Three other versions, essentially identical, are A085750, A097067, A118442.

Cf. A027471, A003945, A059670, A167591.

Cf. A059260, A016777.

Cf. A212697.

Sequence in context: A090634 A097067 A139756 * A085750 A118442 A038592

Adjacent sequences:  A001784 A001785 A001786 * A001788 A001789 A001790

nonn,easy,nice,changed

N. J. A. Sloane

approved