

A000337


a(n) = (n1)*2^n + 1.
(Formerly M3874 N1587)


69



0, 1, 5, 17, 49, 129, 321, 769, 1793, 4097, 9217, 20481, 45057, 98305, 212993, 458753, 983041, 2097153, 4456449, 9437185, 19922945, 41943041, 88080385, 184549377, 385875969, 805306369, 1677721601, 3489660929, 7247757313, 15032385537, 31138512897, 64424509441
(list;
graph;
refs;
listen;
history;
text;
internal format)



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
a(n) is the number of directed columnconvex 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 ncube = a(n3) = 1+(n4)*2^(n3), n>1.
Sum of ordered partitions of n where each element is summed via T(e1). See A066185 for more information.  Jon Perry, Dec 12 2003
a(n2) is the number of Dyck npaths 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 123 that contain the pattern 132 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)]^(i1). 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^(q3))*(q4) + 1 such that M_q and its dual have polyhedral embeddings in R^3 [McMullen et al.].  Jonathan Vos Post, Jul 25 2009
(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 nth number that is a sum of n positive nth 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(n1) 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(n1) 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(n1) 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. 1011 in Kiah et al.).  Stefano Spezia, Nov 02 2021


REFERENCES

F. Harary, Topological concepts in graph theory, pp. 1317 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. AddisonWesley, 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



FORMULA

Binomial transform of A004273. Binomial transform of A008574 if the leading zero is dropped.
G.f.: x/((1x)*(12*x)^2).  Simon Plouffe in his 1992 dissertation
E.g.f.: exp(x)  exp(2*x)*(12*x). a(n) = 4*a(n1)  4*a(n2)+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
Convolution of "Number of fixed points in all 231avoiding involutions in S_n" (A059570) with "The odd numbers" (A005408), treating the result as if offset=0.  Graeme McRae, Jul 12 2006
a(n) = 5*a(n1)  8*a(n2) + 4*a(n3), n > 2.  Harvey P. Dale, Jun 21 2011


MAPLE



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

(PARI) a(n)=if(n<0, 0, (n1)*2^n+1)


CROSSREFS



KEYWORD

nonn,easy,nice


AUTHOR



STATUS

approved



