Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Q&A

Post History

#1: Initial revision by user avatar Peter Taylor‭ · 2022-06-30T17:23:47Z (over 2 years ago)
Do the Faber partition polynomials have integer coefficients?
The Online Encyclopedia of Integer Sequences includes [A263916: Coefficients of the Faber partition polynomials](https://oeis.org/A263916). Perhaps the clearest definition given is

> -log(1 + b(1) x + b(2) x^2 + ...) = Sum_{n>=1} F(n,b(1),...,b(n)) * x^n/n

which in better notation is

$$\sum_{n \ge 1} F_n(b_1, \ldots, b_n) \frac{x^n}n = -\log(1 + b_1 x + b_2 x^2 + \cdots)$$

E.g. $$F_4(b_1,b_2,b_3,b_4) = -4b_4 + 4b_1 b_3 + 2b_2^2 - 4b_1^2 b_2 + b_1^4$$

The fact that it's listed in OEIS suggests that all of the coefficients should be integers, but none of the formulae or comments in the page obviously tells me that they are. What's the most straightforward way to see this?