login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A288689 Number of n-digit biquanimous strings using digits {0,1,...,5}. 2

%I #5 Jun 14 2017 10:22:24

%S 1,1,6,46,376,2841,19718,128535,805848,4942711,29970542,180700389,

%T 1086570460,6525662885,39170135870,235062159691,1410477973872,

%U 8463133736523,50779476069198,304678570340665,1828075815690100,10968466276145161,65810827526263678

%N Number of n-digit biquanimous strings using digits {0,1,...,5}.

%C A biquanimous string is a string whose digits can be split into two groups with equal sums.

%H Alois P. Heinz, <a href="/A288689/b288689.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Rec#order_12">Index entries for linear recurrences with constant coefficients</a>, signature (23, -231, 1351, -5153, 13557, -25301, 33829, -32226, 21368, -9376, 2448, -288).

%F G.f.: (144*x^14 -1224*x^13 +4976*x^12 -11002*x^11 +18115*x^10 -25255*x^9 +30319*x^8 -29516*x^7 +21747*x^6 -11691*x^5 +4506*x^4 -1212*x^3 +214*x^2 -22*x +1) / ((6*x-1) *(3*x-1) *(2*x-1)^4 *(x-1)^6).

%Y Column k=5 of A288638.

%K nonn,easy

%O 0,3

%A _Alois P. Heinz_, Jun 13 2017

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 10 09:34 EDT 2024. Contains 372377 sequences. (Running on oeis4.)