All Questions
Tagged with integer-sequences reference-request
25 questions
26
votes
3
answers
907
views
What is the smallest size of a shape in which all fixed $n$-polyominos can fit?
Let $n$ be an integer and consider all fixed $n$-polyominos, i.e., without rotation or reflection. I am interested in finding a shape in which all polyominos can embed. (It is OK if multiple ...
22
votes
1
answer
2k
views
Reference request: a tale of two mathematicians
I've heard tell the following anecdote involving Pierre Gabriel and Jacques Tit at least twice in a lapse of four years or so:
When P. Gabriel presented the theorem in a conference [sometime around ...
19
votes
2
answers
581
views
Sequences with 3 letters
For a positive integer $n$ I would like to construct long sequences consisting of 0, 1 and 2's such that for any two subsequences consisting of $n$ consecutive elements the number of 0's , 1's or 2'...
17
votes
2
answers
3k
views
Some unpublished notes of Hofstadter
I'm looking for some unpublished notes called "Eta Lore," which are apparently related to a talk Douglas Hofstadter first gave at the Stanford Math Club in 1963. I know these notes exist because they'...
14
votes
4
answers
2k
views
Integrality of a sequence formed by sums
Consider the following sequence defined as a sum
$$a_n=\sum_{k=0}^{n-1}\frac{3^{3n-3k-1}\,(7k+8)\,(3k+1)!}{2^{2n-2k}\,k!\,(2k+3)!}.$$
QUESTION. For $n\geq1$, is the sequence of rational numbers $a_n$ ...
9
votes
2
answers
1k
views
The p-adic valuation of a linear recurrence
Let $(u_n)_{n \geq 0}$ be an integer-valued linear recurrence of order $k \geq 1$. Precisely,
$$u_n = a_1 u_{n-1} + \cdots + a_k u_{n - k} \quad \forall n \geq k ,$$
for some $a_1, \ldots, a_k \in \...
8
votes
4
answers
755
views
Upper bound on length of addition chain
An addition chain for $n$ is a finite sequence of integers starting at 1 and ending at $n$, such that each element is a sum of two previous elements. A short addition chain for $n$ can be used, for ...
7
votes
1
answer
283
views
On one class of Somos-like sequences
This question is motivated by integrability of the sequence mistakenly arisen in the question Does this sequence always give an integer?
Let $m_1,\ldots, m_{k-1}$ be positive integers and sequence $\{...
7
votes
1
answer
125
views
Integer Recursion Reference Request
I've run across the following recursion which at times seems very steady and predictable and at other times seems very chaotic.
Let $c_1, \dots c_k, b_0, m \in \mathbb{Z}$ with $b_0>m\ge 3$ and $...
6
votes
1
answer
450
views
Conway's subprime Fibonacci sequences
I want to be certain I have the latest information on
Conway's subprime Fibonacci sequences,
arXiv-posted a year ago; I am referencing the status in
a review.
To wit, starting with $(0,1)$:1
$$
0, 1, ...
5
votes
1
answer
384
views
Flow of an integer
I've stumbled across this family of flow networks, and posted the sequence of maximal flows to OEIS: A238729. I can't find any reference to it either. Has anyone seen it?
Here is the description:
...
5
votes
0
answers
317
views
Elliptic curve sequences needed for universal forgery
Elliptic Curve Digital Signature Algorithm (ECDSA) admits universal forgery (UF) if the Attacker can solve the equation
$$z=\frac{f_{k-1}(x,y)f_{k+1}(x,y)}{f_{k}(x,y)^2},$$
where $k$ is unknown, $f_{k}...
4
votes
2
answers
593
views
Squares in Lucas sequences
Good night, everyone!
According to a celebrated result by J. H. Cohn, the only perfect squares in the Fibonacci sequence are $F_{0}=0$, $F_{1}=F_{2}=1$, and $F_{12}=144$. It is also known that the ...
4
votes
1
answer
175
views
A binomial coefficient identity involving two parameters
In a recent calculation I obtain a result involving the following expression depending on two integers $n,m\geq 0$:
$$S(n,m):=\frac{(n+m+1)!}{n!m!}\sum_{l=0}^{n+m}\frac{1}{n+m-l+1}\sum_{\substack{j+k=...
3
votes
0
answers
127
views
Is there a name for this operation on integer functions?
Suppose $f$ and $g$ are functions from $\mathbb N^+$ to itself. I want to consider the function $f^g$, where $f^g(n) = f \circ \dots \circ f(n)$, where composition is done $g(n)$-many times. Note ...
3
votes
0
answers
135
views
Permutation of a sequence, such that $y_i+y_{i+1}$ are all distinct
The sequence $x_1, x_2, ..., x_n$ of positive integers contains at least $\frac {2n}{3}+1$ distinct numbers and each of them appears at most three times. How to prove that there is a permutation $y_1, ...
3
votes
0
answers
223
views
Does the divergent solution of this equation :$f'=e^{f^{-1}}$ of Gevrey type and could be Borel summation applied for it?
This question was asked here in MO by someone seeking for the solution of the functional -differential:$f'=e^{f^{-1}}$ not exactly an O.D.E, and again here seeking for the growth rate of it solution ...
2
votes
2
answers
273
views
Alternating binomial-harmonic sum: evaluation request
Let $H_k=\sum_{j=1}^k\frac1j$ be the harmonic numbers.
QUESTION. Can you find an evaluation of the following sum?
$$\sum_{a=1}^b(-1)^a\binom{n}{b-a}\frac{H_{b-a}}a.$$
2
votes
1
answer
217
views
Number of distinct higher dimensional integer partitions
By a distinct partition, I mean a partition into distinct parts, i.e., $10 = 5+4+1$ is one, but $10=6+2+2$ is not. The number of distinct partitions of $k$ all whose parts are at most $n$ is given by ...
2
votes
0
answers
154
views
Equi-distribution of the parity of partitions
The integer partition function $p(n)$ has a generating function given by
$$\frac1{(q)_{\infty}}=\sum_{n=0}^{\infty}p(n)q^n$$
with $(q)_{\infty}=\prod_{m=1}^{\infty}(1-q^m)$. The long-standing problem ...
1
vote
1
answer
81
views
Reference request for multiple free sequences
Erdos usually named a sequence of integers no one of which is divisible by any other as an $M$- sequence (M stands for "multiple-free") or primitive sequence.
For example it is easy to see that $\...
1
vote
0
answers
37
views
Raggedness measure of a sequence
This surely has been done, maybe I googled the wrong adjective...
Define a raggedness measure $r$ of a sequence $S$ in this way:
Two members $S_i,S_j$ of the sequence (who don't have to be adjacent!) ...
1
vote
0
answers
108
views
Question related to sequence of recurrence relation $a_k=\operatorname{rad}(a_{k-1}+a_{k-2})$ for $k\ge 2$ where $a_0=0,a_1=1$
Define radical of an integer Wiki
$$\displaystyle{\mathrm{rad}}(n)=\prod_{{\scriptstyle p\mid n\atop p\:{\text{prime}}}}p$$
Example $n=504=2^3\cdot3^2\cdot7$ therefore ${\displaystyle \operatorname{...
0
votes
0
answers
60
views
Reference request: Counting integer sequences in homogeneous linear recurrences
Are there references in the literature that deal with the probability of finding an integer sequence in a linear homogeneous recurrence with constant coefficients $ \in \mathbb{Z}$? (or provides a way ...
0
votes
0
answers
86
views
Polynomials of integer coefficients that evaluated at Mersenne or Fermat numbers produce square-free integers
Mersenne numbers $M_n=2^n-1$ and Fermat numbers $F_n=2^{2^n}+1$ draw the attention of professional mathematicians to get prime constellations or statements related to primality tests for these ...