# Tagged Questions

For questions about sequences of integers. References are often made to the online resource oeis.org.

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 ...
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 ...
575 views

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 ...
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 ...
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} \...
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 ...
### 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 \label{cp26} F_n^{(p)}=F_{n-1}^{(p)}+F_{n-2}^...
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)$ ...