The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A016116 a(n) = 2^floor(n/2). 162

%I

%S 1,1,2,2,4,4,8,8,16,16,32,32,64,64,128,128,256,256,512,512,1024,1024,

%T 2048,2048,4096,4096,8192,8192,16384,16384,32768,32768,65536,65536,

%U 131072,131072,262144,262144,524288,524288,1048576,1048576,2097152

%N a(n) = 2^floor(n/2).

%C Powers of 2 doubled up. The usual OEIS policy is to omit the duplicates in such cases (when this would become A000079). This is an exception.

%C Number of symmetric compositions of n: e.g., 5 = 2+1+2 = 1+3+1 = 1+1+1+1+1 so a(5) = 4; 6 = 3+3 = 2+2+2 = 1+4+1 = 2+1+1+2 = 1+2+2+1 = 1+1+2+1+1 = 1+1+1+1+1+1 so a(6) = 8. - _Henry Bottomley_, Dec 10 2001

%C This sequence is the number of digits of each term of A061519. - _Dmitry Kamenetsky_, Jan 17 2009

%C Starting with offset 1 = binomial transform of [1, 1, -1, 3, -7, 17, -41, ...]; where A001333 = (1, 1, 3, 7, 17, 41, ...). - _Gary W. Adamson_, Mar 25 2009

%C a(n+1) is the number of symmetric subsets of [n]={1,2,...,n}. A subset S of [n] is symmetric if k is an element of S implies (n-k+1) is an element of S. - _Dennis P. Walsh_, Oct 27 2009

%C INVERT and inverse INVERT transforms give A006138, A039834(n-1).

%C The Kn21 sums, see A180662, of triangle A065941 equal the terms of this sequence. - _Johannes W. Meijer_, Aug 15 2011

%C First differences of A027383. - _Jason Kimberley_, Nov 01 2011

%C Run lengths in A079944. - _Jeremy Gardiner_, Nov 21 2011

%C Number of binary palindromes (A006995) between 2^(n-1) and 2^n (for n>1). - _Hieronymus Fischer_, Feb 17 2012

%C Pisano period lengths: 1, 1, 4, 1, 8, 4, 6, 1, 12, 8, 20, 4, 24, 6, 8, 1, 16, 12, 36, 8, ... . - _R. J. Mathar_, Aug 10 2012

%C Range of row n of the Circular Pascal array of order 4. - _Shaun V. Ault_, May 30 2014

%C a(n) is the number of permutations of length n avoiding both 213 and 312 in the classical sense which are breadth-first search reading words of increasing unary-binary trees. For more details, see the entry for permutations avoiding 231 at A245898. - _Manda Riehl_, Aug 05 2014

%C Also, the decimal representation of the diagonal from the origin to the corner (and from the corner to the origin except for the initial term) of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 190", based on the 5-celled von Neumann neighborhood when initialized with a single black (ON) cell at stage zero. - _Robert Price_, May 10 2017

%C a(n + 1) + n - 1, n > 0, is the number of maximal subsemigroups of the monoid of partial order-preserving or -reversing mappings on a set with n elements. See the East et al. link. - _James Mitchell_ and _Wilf A. Wilson_, Jul 21 2017

%C Number of symmetric stairs with n cells. A stair is a snake polyomino allowing only two directions for adjacent cells: east and north. See A005418. - _Christian Barrientos_, May 11 2018

%C For n >= 4, a(n) is the exponent of the group of the Gaussian integers in a reduced system modulo (1+i)^(n+2). See A302254. - _Jianing Song_, Jun 27 2018

%C a(n) is the number of length-(n+1) binary sequences, denoted <s(1),...,s(n+1)>, with s(1)=1 and with s(i+1)=s(i) for odd i. - _Dennis P. Walsh_, Sep 06 2018

%C a(n+1) is the number of subsets of {1,2,..,n} in which all differences between successive elements of subsets are even. For example, for n = 7, a(6) = 8 and the 8 subsets are {7}, {1,7}, {3,7}, {5,7}, {1,3,7}, {1,5,7}, {3,5,7}, {1,3,5,7}. For odd differences between elements see Comment in A000045 (Fibonacci numbers). - _Enrique Navarrete_, Jul 01 2020

%H Vincenzo Librandi, <a href="/A016116/b016116.txt">Table of n, a(n) for n = 0..5000</a>

%H Shaun V. Ault and Charles Kicey, <a href="http://dx.doi.org/10.1016/j.disc.2014.05.020">Counting paths in corridors using circular Pascal arrays</a>, Discrete Mathematics, Volume 332, 6 October 2014, Pages 45-54.

%H Shaun V. Ault and Charles Kicey, <a href="http://arxiv.org/abs/1407.2197">Counting paths in corridors using circular Pascal arrays</a>, arXiv:1407.2197 [math.CO], 2014.

%H Arvind Ayyer, Amritanshu Prasad, and Steven Spallone, <a href="http://arxiv.org/abs/1601.01776">Odd partitions in Young's lattice</a>, arXiv:1601.01776 [math.CO], 2016. See Theorem 6 p. 12.

%H Paul Barry, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL9/Barry/barry91.html">On Integer-Sequence-Based Constructions of Generalized Pascal Triangles</a>, J. Integer Sequ., Vol. 9 (2006), Article 06.2.4.

%H Francesco Battistoni and Giuseppe Molteni, <a href="https://arxiv.org/abs/2101.06163">An elementary proof for a generalization of a Pohst's inequality</a>, arXiv:2101.06163 [math.NT], 2021.

%H Johann Cigler, <a href="http://arxiv.org/abs/1501.04750">Some remarks and conjectures related to lattice paths in strips along the x-axis</a>, arXiv:1501.04750 [math.CO], 2015.

%H Emeric Deutsch, <a href="http://www.jstor.org/stable/2691040">Problem 1633</a>, Math. Mag., 74 #5 (2001), p. 403.

%H James East, Jitender Kumar, James D. Mitchell, and Wilf A. Wilson, <a href="https://arxiv.org/abs/1706.04967">Maximal subsemigroups of finite transformation and partition monoids</a>, arXiv:1706.04967 [math.GR], 2017.

%H A. Goupil, H. Cloutier, and F. Nouboud, <a href="https://doi.org/10.1016/j.dam.2010.08.011">Enumeration of polyominoes inscribed in a rectangle</a> Discrete Applied Mathematics 158(2010), 2014-2023.

%H S. Heubach and T. Mansour, <a href="https://arxiv.org/abs/math/0310197">Counting rises, levels and drops in compositions</a>, arXiv:math/0310197 [math.CO], 2003.

%H INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=1067">Encyclopedia of Combinatorial Structures 1067</a>

%H D. Levin, L. Pudwell, M. Riehl, and A. Sandberg, <a href="http://www.etsu.edu/cas/math/pp2014/documents/talks/riehl.pdf">Pattern Avoidance on k-ary Heaps</a>, Slides of Talk, 2014.

%H D. Merlini, F. Uncini and M. C. Verri, <a href="http://www.emis.de/journals/INTEGERS/papers/e23/e23.Abstract.html">A unified approach to the study of general and palindromic compositions</a>, Integers 4 (2004), A23, 26 pp.

%H Agustín Moreno Cañadas, Hernán Giraldo, and Robinson Julian Serna Vanegas, <a href="http://dx.doi.org/10.17654/MS101122745">Some integer partitions induced by orbits of Dynkin type</a>, Far East Journal of Mathematical Sciences (FJMS), Vol. 101, No. 12 (2017), pp. 2745-2766.

%H Laurent Noé, <a href="http://www.lifl.fr/~noe/files/expose_JOV13.pdf">Spaced seed design on profile HMMs for precise HTS read-mapping efficient sliding window product on the matrix semi-group</a>, in Rapide Bilan 2012-2013, Laurent, LIFL, Université Lille 1 - INRIA Journées au vert 11 et 12 juin 2013, Laurent, Année 2012-2013.

%H Valentin Ovsienko, <a href="http://images.math.cnrs.fr/Villes-paires-et-impaires-Oddtown-2470.html">Villes paires et impaires (Oddtown and Eventown) I</a>, Images des Mathématiques, CNRS, 2013 (in French).

%H Dennis Walsh, <a href="http://capone.mtsu.edu/dwalsh/SYMMSUB.pdf">Notes on symmetric subsets of {1, 2, ..., n}</a> [From _Dennis P. Walsh_, Oct 27 2009]

%H A. Yajima, <a href="https://doi.org/10.1246/bcsj.20140204">How to calculate the number of stereoisomers of inositol-homologs</a>, Bull. Chem. Soc. Jpn. 2014, 87, 1260-1264 | doi:10.1246/bcsj.20140204. See Tables 1 and 2 (and text). - _N. J. A. Sloane_, Mar 26 2015

%H <a href="/index/Di#divseq">Index to divisibility sequences</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,2).

%F a(n) = a(n-1)*a(n-2)/a(n-3) = 2*a(n-2) = 2^A004526(n).

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

%F a(n) = (1/2 + sqrt(1/8))*sqrt(2)^n + (1/2 - sqrt(1/8))*(-sqrt(2))^n. - _Ralf Stephan_, Mar 11 2003

%F E.g.f.: cosh(sqrt(2)*x) + sinh(sqrt(2)*x)/sqrt(2). - _Paul Barry_, Jul 16 2003

%F The signed sequence (-1)^n*2^floor(n/2) has a(n) = (sqrt(2))^n(1/2 - sqrt(2)/4) + (-sqrt(2))^n(1/2 + sqrt(2)/4). It is the inverse binomial transform of A000129(n-1). - _Paul Barry_, Apr 21 2004

%F Diagonal sums of A046854. a(n) = Sum_{k=0..n} binomial(floor(n/2), k). - _Paul Barry_, Jul 07 2004

%F a(n) = a(n-2) + 2^floor((n-2)/2). - _Paul Barry_, Jul 14 2004

%F a(n) = Sum_{k=0..floor(n/2)} binomial(floor(n/2), floor(k/2)). - _Paul Barry_, Jul 15 2004

%F E.g.f.: cosh(asinh(1) + sqrt(2)*x)/sqrt(2). - _Michael Somos_, Feb 28 2005

%F a(n) = Sum_{k=0..n} A103633(n,k). - _Philippe Deléham_, Dec 03 2006

%F a(n) = 2^(n/2)*((1 + (-1)^n)/2 + (1-(-1)^n)/(2*sqrt(2))). - _Paul Barry_, Nov 12 2009

%F a(n) = 2^((2*n - 1 + (-1)^n)/4). - _Luce ETIENNE_, Sep 20 2014

%e For n=5 the a(5)=4 symmetric subsets of  are {1,4}, {2,3}, {1,2,3,4} and the empty set. - _Dennis P. Walsh_, Oct 27 2009

%e For n=5 the a(5)=4 length-6 binary sequences are <1,1,0,0,0,0>, <1,1,0,0,1,1>, <1,1,1,1,0,0> and <1,1,1,1,1,1>. - _Dennis P. Walsh_, Sep 06 2018

%p A016116:= proc(n): 2^floor(n/2) end: seq(A016116(n), n=0..42); # _Dennis P. Walsh_, Oct 27 2009

%t Table[ 2^Floor[n/2], {n, 0, 42}] (* _Robert G. Wilson v_, Jun 05 2004 *)

%t With[{c=2^Range[0,30]},Riffle[c,c]] (* _Harvey P. Dale_, Jan 23 2015 *)

%t CoefficientList[Series[(1+x)/(1-2*x^2), {x, 0, 50}], x] (* _Stefano Spezia_, Sep 07 2018 *)

%o (PARI) a(n)=if(n<0,0,2^(n\2))

%o (MAGMA) [2^Floor(n/2): n in [0..50]]; // _Vincenzo Librandi_, Aug 16 2011

%o (Maxima) makelist(2^floor(n/2), n, 0, 50); /* _Martin Ettl_, Oct 17 2012 */

%o (Sage)

%o def A016116():

%o x, y = -1, 0

%o while True:

%o yield -x

%o x, y = x + y, x - y

%o a = A016116(); [next(a) for i in range(40)] # _Peter Luschny_, Jul 11 2013

%o (GAP) List([0..45],n->2^Int(n/2)); # _Muniru A Asiru_, Apr 03 2018

%Y Cf. A006995, A057148, A079944, A112030, A112033.

%Y a(n) = A094718(3, n).

%Y Cf. A001333.

%Y See A052955 for partial sums (without the initial term).

%Y A000079 gives the odd-indexed terms of a(n).

%K nonn,easy

%O 0,3

%A _N. J. A. Sloane_, Dec 11 1999

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 10 06:54 EDT 2021. Contains 342843 sequences. (Running on oeis4.)