cp's OEIS Frontend

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.

A288691 Number of n-digit biquanimous strings using digits {0,1,...,7}.

Original entry on oeis.org

1, 1, 8, 85, 988, 10696, 104676, 939863, 7980376, 65679175, 532115106, 4279710436, 34311898336, 274729437763, 2198561705222, 17590732383423, 140732804110800, 1125884352801489, 9007145852828686, 72057404552774828, 576460059887430848, 4611683426113781209
Offset: 0

Views

Author

Alois P. Heinz, Jun 13 2017

Keywords

Comments

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

Crossrefs

Column k=7 of A288638.

Formula

G.f.: (9216*x^24 -129408*x^23+881824*x^22 -3910528*x^21 +12761816*x^20 -31636760*x^19 +62309010*x^18 -101187417*x^17 +139600728*x^16 -166854657*x^15 +174047204*x^14 -158809357*x^13 +127270681*x^12 -89880736*x^11 +55637484*x^10 -29668152*x^9 +13297571*x^8 -4887342*x^7 +1441132*x^6 -333899*x^5 +59267*x^4 -7757*x^3 +702*x^2 -39*x +1) / ((8*x-1) *(4*x-1) *(3*x-1)^2 *(2*x-1)^6 *(x-1)^10).