A000337 - OEIS

OFFSET

0,3

COMMENTS

a(n) also gives number of 0's in binary numbers 1 to 111..1 (n+1 bits). - Stephen G Penrice, Oct 01 2000

Numerator of m(n) = (m(n-1)+n)/2, m(0)=0. Denominator is A000079. - Reinhard Zumkeller, Feb 23 2002

a(n) is the number of directed column-convex polyominoes of area n+2 having along the lower contour exactly one vertical step that is followed by a horizontal step (a reentrant corner). - Emeric Deutsch, May 21 2003

a(n) is the number of bits in binary numbers from 1 to 111...1 (n bits). Partial sums of A001787. - Emeric Deutsch, May 24 2003

Genus of graph of n-cube = a(n-3) = 1+(n-4)*2^(n-3), n>1.

Sum of ordered partitions of n where each element is summed via T(e-1). See A066185 for more information. - Jon Perry, Dec 12 2003

a(n-2) is the number of Dyck n-paths with exactly one peak at height >= 3. For example, there are 5 such paths with n=4: UUUUDDDD, UUDUUDDD, UUUDDUDD, UDUUUDDD, UUUDDDUD. - David Callan, Mar 23 2004

Permutations in S_{n+2} avoiding 12-3 that contain the pattern 13-2 exactly once.

a(n) is prime for n = 2, 3, 7, 27, 51, 55, 81. a(n) is semiprime for n = 4, 5, 6, 8, 9, 10, 11, 13, 15, 19, 28, 32, 39, 57, 63, 66, 75, 97. - Jonathan Vos Post, Jul 18 2005

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

Starting with 1 = row sums of A023758 as a triangle by rows: [1; 2,3; 4,6,7; 8,12,14,15; ...]. - Gary W. Adamson, Jul 18 2008

Equivalent formula given in Brehm: for each q >= 3 there exists a polyhedral map M_q of type {4, q} with [number of vertices] f_0 = 2^q and [genus] g = (2^(q-3))*(q-4) + 1 such that M_q and its dual have polyhedral embeddings in R^3 [McMullen et al.]. - Jonathan Vos Post, Jul 25 2009

Sums of rows of the triangle in A173787. - Reinhard Zumkeller, Feb 28 2010

This sequence is related to A000079 by a(n) = n*A000079(n)-Sum_{i=0..n-1} A000079(i). - Bruno Berselli, Mar 06 2012

(1 + 5*x + 17*x^2 + 49*x^3 + ...) = (1 + 2*x + 4*x^2 + 8*x^3 + ...) * (1 + 3*x + 7*x^2 + 15*x^3 + ...). - Gary W. Adamson, Mar 14 2012

The first barycentric coordinate of the centroid of Pascal triangles, assuming that numbers are weights, is A000295(n+1)/A000337(n), no matter what the triangle sides are. See attached figure. - César Eliud Lozada, Nov 14 2014

a(n) is the n-th number that is a sum of n positive n-th powers for n >= 1. a(4) = 49 = A003338(4). - Alois P. Heinz, Aug 01 2020

a(n) is the sum of the largest elements of all subsets of {1,2,..,n}. For example, a(3)=17; the subsets of {1,2,3} are {1}, {2}, {3}, {1,2}, {1,3}, {2,3}, {1,2,3}, and the sum of the largest elements is 17. - Enrique Navarrete, Aug 20 2020

a(n-1) is the sum of the second largest elements of the subsets of {1,2,..,n} that contain n. For example, for n = 4, a(3)=17; the subsets of {1,2,3,4} that contain 4 are {4}, {1,4}, {2,4}, {3,4}, {1,2,4}, {1,3,4}, {2,3,4}, {1,2,3,4}, and the sum of the second largest elements is 17. - Enrique Navarrete, Aug 24 2020

a(n-1) is also the sum of diameters of all subsets of {1,2,...,n} that contain n. For example, for n = 4, a(3)=17; the subsets of {1,2,3,4} that contain 4 are {4}, {1,4}, {2,4}, {3,4}, {1,2,4}, {1,3,4}, {2,3,4}, {1,2,3,4}; the diameters of these sets are 0,3,2,1,3,3,2,3 and the sum is 17. - Enrique Navarrete, Sep 07 2020

a(n-1) is also the number of additions required to compute the permanent of general n X n matrices using trellis methods (see Theorems 5 and 6, pp. 10-11 in Kiah et al.). - Stefano Spezia, Nov 02 2021

REFERENCES

F. Harary, Topological concepts in graph theory, pp. 13-17 of F. Harary and L. Beineke, editors, A seminar on Graph Theory, Holt, Rinehart and Winston, New York, 1967.

V. G. Gutierrez and S. L. de Medrano, Surfaces as complete intersections, in Riemann and Klein Surfaces, Automorphisms, Symmetries and Moduli Spaces, edited by Milagros Izquierdo, S. Allen Broughton, Antonio F. Costa, Contemp. Math. vol. 629, 2014, pp. 171-.

F. Harary, Graph Theory. Addison-Wesley, Reading, MA, 1969, p. 119.

G. H. Hardy, A Theorem Concerning the Infinite Cardinal Numbers, Quart. J. Math., 35 (1904), p. 90 = Collected Papers of G. H. Hardy, Vol. VII, p. 430.

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).

LINKS

Indranil Ghosh, Table of n, a(n) for n = 0..1000 (first 301 terms from T. D. Noe)

H. H. Bauschke and R. M. Corless, Analyzing a Projection Method with Maple, MapleTech Journal, 4:1 (1997), 2-7.

L. W. Beineke and F. Harary, The genus of the n-cube, Canad. J. Math., 17 (1965), 494-496.

Ulrich Brehm and Egon Schulte, Polyhedral Maps. [Jonathan Vos Post, Jul 25 2009]

Harry Crane, Left-right arrangements, set partitions, and pattern avoidance, Australasian Journal of Combinatorics, 61(1) (2015), 57-72.

Pedro Fernando Fernández Espinosa and Agustín Moreno Cañadas, Homological Ideals as Integer Specializations of Some Brauer Configuration Algebras, arXiv:2104.00050 [math.RT], 2021.

Ricardo Gómez Aíza, Trees with flowers: A catalog of integer partition and integer composition trees with their asymptotic analysis, arXiv:2402.16111 [math.CO], 2024. See p. 23.

R. K. Guy, Catwalks, sandsteps and Pascal pyramids, J. Integer Sequences, Vol. 3 (2000), Article #00.1.6.

Christian Kassel and Christophe Reutenauer, The zeta function of the Hilbert scheme of n points on a two-dimensional torus, arXiv:1505.07229v3 [math.AG], 2015. [A later version of this paper has a different title and different contents, and the number-theoretical part of the paper was moved to the publication below.]

Christian Kassel and Christophe Reutenauer, Complete determination of the zeta function of the Hilbert scheme of n points on a two-dimensional torus, arXiv:1610.07793 [math.NT], 2016.

Han Mao Kiah, Alexander Vardy, and Hanwen Yao, Computing Permanents on a Trellis, arXiv:2107.07377 [cs.IT], 2021.

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

Sergey Kitaev, Jeffrey Remmel, and Mark Tiefenbruck, Quadrant Marked Mesh Patterns in 132-Avoiding Permutations II, Electronic Journal of Combinatorial Number Theory, Volume 15 2015, #A16. (arXiv, arXiv:1302.2274 [math.CO], 2013)

Santiago López de Medrano, On the genera of moment-angle manifolds associated to dual-neighborly polytopes, combinatorial formulas and sequences, arXiv:2003.07508 [math.GT], 2020.

César Eliud Lozada, Centroids of Pascal triangles

P. McMullen, Ch. Schulz and J.M. Wills, Polyhedral manifolds in E^3 with unusually large genus, Israel J. Math. 46:127-144, 1983. [From Jonathan Vos Post, Jul 25 2009]

Toufik Mansour, Restricted permutations by patterns of type (2,1), arXiv:math/0202219 [math.CO], 2002.

Michael Penn, An awesome number theory contest problem, YouTube video, 2022.

Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.

Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992

Len Smiley, Hardy's algorithm.

Nsibiet E. Udo, Praise Adeyemo, Balazs Szendroi, and Stavros Argyrios Papadakis, Ideals, representations and a symmetrised Bernoulli triangle, arXiv:2409.10278 [math.AC], 2024. See pp. 2,4,8.

Eric Weisstein's World of Mathematics, Graph Genus.

Eric Weisstein's World of Mathematics, Hypercube Graph.

A. F. Y. Zhao, Pattern Popularity in Multiply Restricted Permutations, Journal of Integer Sequences, 17 (2014), #14.10.3.

Index entries for linear recurrences with constant coefficients, signature (5,-8,4).

FORMULA

Binomial transform of A004273. Binomial transform of A008574 if the leading zero is dropped.

G.f.: x/((1-x)*(1-2*x)^2). - Simon Plouffe in his 1992 dissertation

E.g.f.: exp(x) - exp(2*x)*(1-2*x). a(n) = 4*a(n-1) - 4*a(n-2)+1, n>0. Series reversion of g.f. A(x) is x*A034015(-x). - Michael Somos

Binomial transform of n/(n+1) is a(n)/(n+1). - Paul Barry, Aug 19 2005

a(n) = A119258(n+1,n-1) for n>0. - Reinhard Zumkeller, May 11 2006

Convolution of "Number of fixed points in all 231-avoiding involutions in S_n" (A059570) with "The odd numbers" (A005408), treating the result as if offset=0. - Graeme McRae, Jul 12 2006

a(n) = Sum_{k=1..n} k*2^(k-1), partial sums of A001787. - Zerinvary Lajos, Oct 19 2006

a(n) = 5*a(n-1) - 8*a(n-2) + 4*a(n-3), n > 2. - Harvey P. Dale, Jun 21 2011

a(n) = Sum_{k=1..n} Sum_{i=1..n} i * C(k,i). - Wesley Ivan Hurt, Sep 19 2017

a(n) = A000295(n+1)^2 - A000295(n)*A000295(n+2). - Gregory Gerard Wojnar, Oct 23 2018

MAPLE

A000337 := proc(n) 1+(n-1)*2^n ; end proc: # R. J. Mathar, Oct 10 2011

MATHEMATICA

Table[Sum[(-1)^(n - k) k (-1)^(n - k) Binomial[n + 1, k + 1], {k, 0, n}], {n, 0, 28}] (* Zerinvary Lajos, Jul 08 2009 *)

Table[(n - 1) 2^n + 1, {n, 0, 40}] (* Harvey P. Dale, Jun 21 2011 *)

LinearRecurrence[{5, -8, 4}, {0, 1, 5}, 40] (* Harvey P. Dale, Jun 21 2011 *)

CoefficientList[Series[x / ((1 - x) (1 - 2 x)^2), {x, 0, 50}], x] (* Vincenzo Librandi, Nov 21 2014 *)

PROG