Papers
Topics
Authors
Recent
Search
2000 character limit reached

Congruences for the Fishburn Numbers

Published 21 Jan 2014 in math.NT | (1401.5345v1)

Abstract: The Fishburn numbers, $\xi(n),$ are defined by a formal power series expansion $$ \sum_{n=0}\infty \xi(n)qn = 1 + \sum_{n=1}\infty \prod_{j=1}n (1-(1-q)j). $$ For half of the primes $p$, there is a non--empty set of numbers $T(p)$ lying in $[0,p-1]$ such that if $j\in T(p),$ then for all $n\geq 0,$ $$ \xi(pn+j)\equiv 0 \pmod{p}. $$

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.