login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275439 Sum of the asymmetry degrees of all compositions of n with parts in {1,2}. 2
0, 0, 0, 2, 2, 6, 12, 22, 42, 78, 140, 252, 448, 788, 1380, 2402, 4158, 7170, 12316, 21082, 35982, 61246, 103992, 176184, 297888, 502728, 846984, 1424738, 2393114, 4014270, 6725196, 11253694, 18810930, 31410894, 52400132, 87335604, 145438624, 242001692 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

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

A sequence is palindromic if and only if its asymmetry degree is 0.

LINKS

Colin Barker, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (1,2,1,-2,-3,-1).

FORMULA

G.f.: g(z) = 2z^3/((1+z+z^2)(1-z-z^2)^2). In the more general situation of compositions into a[1]<a[2]<a[3]<..., denoting F(z) = Sum(z^{a[j]},j>=1}, we have g(z)=(F(z)^2-F(z^2))/((1+F(z))(1-F(z))^2).

a(n) = (n+1)/2-(3/2)*floor((n+2)/3)+(3/5)*(n+1)f(n)-(1/10)*(2n+5)f(n+1), where f(j)= A000045(j) are the Fibonacci numbers.

a(n) = Sum_{k>=0} k*A275438(n,k).

EXAMPLE

a(5) = 6 because the compositions of 5 with parts in {1,2} are 122, 212, 221, 1112, 1121, 1211, 2111, and 11111 and the sum of their asymmetry degrees is 1 + 0 + 1 + 1 + 1 + 1 + 1 + 0 = 6.

MAPLE

f := n -> combinat:-fibonacci(n):

a := n -> (n+1)/2-(3/2)*floor((n+2)/3)+(3/5)*(n+1)*f(n)-(1/10)*(2*n+5)*f(n+1):

seq(a(n), n = 0..40);

# alternative program:

g := 2*z^3/((1+z+z^2)*(1-z-z^2)^2):

gser := series(g, z=0, 45):

seq(coeff(gser, z, n), n = 0..40);

MATHEMATICA

Join[{0}, Table[Total@ Map[Total, Map[BitXor[Take[# - 1, Ceiling[Length[#]/2]], Reverse@ Take[# - 1, -Ceiling[Length[#]/2]]] &,

Flatten[Map[Permutations, DeleteCases[IntegerPartitions@ n, {a_, ___} /; a > 2]], 1]]], {n, 30}]] (* Michael De Vlieger, Aug 17 2016 *)

PROG

(PARI) concat(vector(3), Vec(2*x^3/((1+x+x^2)*(1-x-x^2)^2) + O(x^50))) \\ Colin Barker, Aug 28 2016

CROSSREFS

Cf. A000045, A275438.

Sequence in context: A157285 A320068 A345988 * A173392 A324128 A217211

Adjacent sequences:  A275436 A275437 A275438 * A275440 A275441 A275442

KEYWORD

nonn,easy

AUTHOR

Emeric Deutsch, Aug 16 2016

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 01:25 EST 2021. Contains 349558 sequences. (Running on oeis4.)