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 A276063 #22 Apr 12 2025 05:18:11
%S A276063 0,0,0,0,0,2,2,4,4,8,14,20,32,44,70,104,152,228,326,488,704,1026,1492,
%T A276063 2144,3120,4470,6450,9256,13256,19026,27144,38840,55360,78910,112406,
%U A276063 159768,227240,322500,457734,648996,919372,1302114,1842036,2605452,3682112
%N A276063 Sum of the asymmetry degrees of all compositions of n with parts in {1,4}.
%C A276063 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 A276063 A sequence is palindromic if and only if its asymmetry degree is 0.
%H A276063 Colin Barker, <a href="/A276063/b276063.txt">Table of n, a(n) for n = 0..1000</a>
%H A276063 Krithnaswami Alladi and V. E. Hoggatt, Jr. <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/13-3/alladi1.pdf">Compositions with Ones and Twos</a>, Fibonacci Quarterly, 13 (1975), 233-239.
%H A276063 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 A276063 <a href="/index/Rec#order_12">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,-1,1,2,-3,0,1,-3,0,0,-1).
%F A276063 G.f.: g(z) = 2*z^5/((1+z+z^4)*(1-z-z^4)^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 A276063 a(n) = Sum_{k>=0} k*A276062(n,k).
%e A276063 a(6) = 2 because the compositions of 6 with parts in {1,4} are 411, 141, 114, and 111111 and the sum of their asymmetry degrees is 1+0+1+0.
%p A276063 g := 2*z^5/((1+z+z^4)*(1-z-z^4)^2): gser := series(g, z = 0, 45): seq(coeff(gser, z, n), n = 0 .. 40);
%t A276063 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_, ___} /; Nor[a == 1, a == 4]]], 1]]], {n, 0, 38}] // Flatten (* _Michael De Vlieger_, Aug 22 2016 *)
%o A276063 (PARI) concat(vector(5), Vec(2*x^5/((1+x+x^4)*(1-x-x^4)^2) + O(x^50))) \\ _Colin Barker_, Aug 28 2016
%Y A276063 Cf. A276062.
%K A276063 nonn,easy
%O A276063 0,6
%A A276063 _Emeric Deutsch_, Aug 22 2016