14 citations · 26 across the 9 of their papers we have counts for
11 papers
On -sumfree sequences
Daan van Berkel, Wieb Bosma
In this paper we explore the world of -sumfree sequences, primarily for and . Starting with increasing positive integers, build an infinite sequence by choosing a…
Sums of nearest integer continued fractions with bounded digits:
Wieb Bosma, Alex Brouwers
Adapting Cantor set methods that were used by Hall and Hlawka for regular continued fractions, we prove that every real number can be obtained as the sum of two real numbers for wh…
Using Walnut to solve problems from the OEIS
Wieb Bosma, Rene Bruin, Robbert Fokkink +3
We use the automatic theorem prover Walnut to resolve various open problems from the OEIS and beyond. Specifically, we clarify the structure of sequence A260311, which concerns run…
Hoffman colorings of graphs
Aida Abiad, Wieb Bosma, Thijs van Veluw
Hoffman's bound is a well-known spectral bound on the chromatic number of a graph, known to be tight for instance for bipartite graphs. While Hoffman colorings (colorings attaining…
A remarkable sequence related to and
Wieb Bosma, Michel Dekking, Wolfgang Steiner
We prove that five ways to define entry A086377 in the On-Line Encyclopedia of Integer Sequences do lead to the same integer sequence.
Aliquot sequences with small starting values
Wieb Bosma
We describe the results of the computation of aliquot sequences with small starting values. In particular all sequences with starting values less than a million have been computed…