This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A275443 #19 Apr 12 2025 01:00:21
%S A275443 0,0,0,0,2,4,8,16,34,68,134,260,502,960,1824,3444,6472,12108,22566,
%T A275443 41912,77608,143312,263990,485196,889938,1629256,2977642,5433344,
%U A275443 9899776,18013288,32734928,59417944,107732106,195130092,353087560,638329168,1153012298
%N A275443 Sum of the asymmetry degrees of all compositions of n without 2's.
%C A275443 The asymmetry degree of a finite sequence of numbers is defined to be the number of pairs of symmetrically positioned distinct entries. Example: the asymmetry degree of (2,7,6,4,5,7,3) is 2, counting the pairs (2,3) and (6,5).
%C A275443 A sequence is palindromic if and only if its asymmetry degree is 0.
%D A275443 S. Heubach and T. Mansour, Combinatorics of Compositions and Words, CRC Press, 2010.
%H A275443 Colin Barker, <a href="/A275443/b275443.txt">Table of n, a(n) for n = 0..1000</a>
%H A275443 P. Chinn and S. Heubach, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL6/Heubach/heubach5.html">Integer Sequences Related to Compositions without 2's</a>, J. Integer Seqs., Vol. 6, 2003.
%H A275443 V. E. Hoggatt, Jr. and Marjorie Bicknell, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/13-4/hoggatt1.pdf">Palindromic compositions</a>, Fibonacci Quart., Vol. 13(4), 1975, pp. 350-356.
%H A275443 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2,0,1,-3,1,-1).
%F A275443 G.f.: g(z) = 2*z^4*(1-z)/((1+z)*(1-2*z+z^2-z^3)^2). In the more general situation of compositions into a[1]<a[2]<a[3]<..., denoting F(z) = Sum_{j>=1} z^(a[j]), we have g(z) = (F(z)^2 - F(z^2))/((1+F(z))*(1-F(z))^2).
%F A275443 a(n) = Sum_{k >= 0} k*A275442(n,k).
%e A275443 a(5) = 4 because the compositions of 5 without 2's are 5, 41, 14, 311, 131, 113, and 11111 and the sum of their asymmetry degrees is 0+1+1+1+0+1+0=4.
%p A275443 g := 2*z^4*(1-z)/((1+z)*(1-2*z+z^2-z^3)^2): gser := series(g, z = 0, 45): seq(coeff(gser, z, n), n = 0 .. 40);
%t A275443 Table[Total@ Map[Total, Map[Map[Boole[# >= 1] &, BitXor[Take[# - 1, Ceiling[Length[#]/2]], Reverse@ Take[# - 1, -Ceiling[Length[#]/2]]]] &, Flatten[Map[Permutations, DeleteCases[IntegerPartitions@ n, {___, a_, ___} /; a == 2]], 1]]], {n, 0, 25}] // Flatten (* _Michael De Vlieger_, Aug 17 2016 *)
%o A275443 (PARI) concat(vector(4), Vec(2*x^4*(1-x)/((1+x)*(1-2*x+x^2-x^3)^2) + O(x^50))) \\ _Colin Barker_, Aug 29 2016
%Y A275443 Cf. A180177, A275442.
%K A275443 nonn,easy
%O A275443 0,5
%A A275443 _Emeric Deutsch_, Aug 16 2016