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

learn more… | top users | synonyms

12
votes
0answers
315 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
0answers
572 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 ...
10
votes
0answers
553 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
0answers
129 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) = ...
6
votes
0answers
355 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
0answers
364 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 ...
3
votes
0answers
44 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
0answers
60 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
0answers
224 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
0answers
578 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
0answers
142 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
0answers
54 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
0answers
283 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} ...
0
votes
0answers
60 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)$ ...