**12**

votes

**0**answers

336 views

### Word complexity of primes mod 4

For an infinite binary word $w$, the word complexity $f_w(n)$ is defined as the number of different subwords of length $n$. The asymptotic behavior of this function is an important parameter of the ...

**11**

votes

**0**answers

604 views

### Is OEIS A007018 really a subsequence of squarefree numbers?

A comment in A007018 a(n) = a(n-1)^2 + a(n-1), a(0)=1 claims
Subsequence of squarefree numbers (A005117). - Reinhard Zumkeller, Nov 15 2004
Is it really so?
As far as I know, it is open problem ...

**11**

votes

**0**answers

575 views

### Is “OEIS A001935 Number of partitions with no even part repeated” efficiently computable $\mod 4$?

Is A001935 Number of partitions with no even part repeated efficiently computable $\mod 4$?
I am interested because of this relation with sum of divisors of $8n+1$.
$\sigma(8n+1) \equiv A001935(n) \...

**6**

votes

**0**answers

137 views

### When is the ratio of Jacobi theta functions algebraic?

Probably this is well known.
$\theta_2$ and $\theta_3$ are Jacobi theta functions
as defined in mathworld (31) and (32).
For natural $n$ define
$$ f(n) = \frac{\theta_2(-e^{-\pi\sqrt{n}})}{\theta_3(-...

**6**

votes

**0**answers

400 views

### Graphs with graphic imbalance sequences

Let $G$ be simple undirected graph and $e=uv\in E(G)$.
The imbalance of the edge $e$ is the value $imb(e)=|d(u)-d(v)|$.
Let $M_{G}$ denotes the imbalance sequence (or more correctly, multiset of ...

**5**

votes

**0**answers

394 views

### Number of Configurations in the optimal Hanoi tower

There is a unique strategy how to move $n$ disks from the first rod to the second optimally and it takes $2^n-1$ steps, solution is obtained by simple recursion. I am interested into the following ...

**4**

votes

**0**answers

166 views

### A strange polynomial equality

In my answer to this question, I have obtained that the polynomial $p(x)$ of degree $2n$ with nonnegative values on $[-1,1]$ with $p(\pm1)=1$ has $\int_{-1}^1 p(x)\,dx\geq \frac{4}{(n+1)(n+2)}$, and ...

**3**

votes

**0**answers

58 views

### Cardinal of a set cinsist of product of two sets?

Let
$$
A=\{1,2,\ldots,p-1\},\qquad B=\{1,2,\ldots,q-1\}
$$
where $p,q$ are primes not necessarily distinct.
Is there any elementary way to find the cardinal of the following set
$$
AB=\{ab:\ a\in A,\ ...

**3**

votes

**0**answers

51 views

### Increasing integral sequence of intermediate growth which is periodic modulo almost all primes

Many integral sequences are periodic modulo (almost) all primes.
However all examples I know are either evaluations of suitable polynomials on consecutive integers (trivial examples) or grow at least ...

**3**

votes

**0**answers

83 views

### Searching information on a certain function with a fixed point property connecting Moebius $\mu$ and Fibonacci numbers

Let $\mu$ be the Moebius function and define for $1\leq n\in\mathbb{N}$
$$
f(n) =
\left\{
\begin{array}{ll}
\mu\left(\frac{n}{2}\right) + \mu\left(\frac{n}{4}\right), & n\equiv 0, 4, 8\mod 12, \\
...

**3**

votes

**0**answers

231 views

### What are the values of this sequence?

Let $F_n$ denote the $n$th Fibonacci number.
Then $\prod\limits_{i=1}^{\infty}(1-x^{F_i})$ is a series all of whose coefficients are either $-1$, $0$ or $+1$.
The sequence of the coefficients in ...

**3**

votes

**0**answers

597 views

### Least Prime Factor in a sequence of 2n consecutive integers

I was thinking about consecutive integers and I wondered if anyone had done work exploring whether a sequence of $2n$ consecutive integers (i.e. 101,102,103,...,100+2n) always contains at least one ...

**2**

votes

**0**answers

115 views

### Additive combinatorics and a Diophantine equation

Let $(n_k)_{1 \leq k \leq N}$ be a sequence of distinct positive integers. For $v \in \mathbb{Z}$ set
$$
A_N(v) = \# \Big\{ (k,\ell) \in \{1, \dots, N\}^2, ~k \neq \ell:\quad n_k - n_\ell = v \Big\}.
$...

**2**

votes

**0**answers

154 views

### Avoiding Fibonacci-like sequences

Suppose we are trying to avoid 3-term arithmetic progressions. There are two relevant sequences in the OEIS pertaining to this:
A003278: The sequence whose $n^{\text{th}}$ term is the smallest number ...

**2**

votes

**0**answers

61 views

### Regular graphs with unimodal subdegrees that are not distance-regular

Distance regular graphs are known to exhibit the following property: starting from an arbitrary vertex $\alpha$, let $k_i$ denote the number of vertices at distance $i$ from $\alpha$ (in terms of ...

**2**

votes

**0**answers

288 views

### A question concerning the strange arithmetic derivation

This question is related to Strange (or stupid) arithmetic derivation. The original question whether an unbounded sequence of iterates exists is still unanswered.
$$n=\prod_{i=1}^{k}p_i^{\alpha_i} \...

**1**

vote

**0**answers

109 views

### Is there a “complete” Sidon sequence?

A sequence of natural numbers $(a_n)$ with the property that all pairwise sums of elements are distinct is called a Sidon sequence and it is proved there are at most $s(n)\sim\sqrt n$ elements of ...

**0**

votes

**0**answers

30 views

### The connection between the length of Fibonacci $p$-step numbers and it's limit values

One of the most important generalization of the classical Fibonacci numbers is the Fibonacci $p$-step numbers that is defined as follows
\begin{equation}\label{cp26}
F_n^{(p)}=F_{n-1}^{(p)}+F_{n-2}^...

**0**

votes

**0**answers

95 views

### Classic question on integer partitions (with distinct summands)

I guess that the following was solved sometime in the 18th century, but could not find a reference to it. I am interested in approximations to the following integer partition problem:
Denote $R(N,L)$ ...