2
votes
0answers
199 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 in …
1
vote
2answers
143 views
sequence, such that sum of any combinations in the sequence does not equal another
Hi,
Is there any known sequence such that the sum of a combination of one subsequence never equals another subsequence sum. The subsequences should have elements only from the …
5
votes
2answers
302 views
sequences with a fractal dimension
This is inspired by the self-similarity of the celebrated Golay-Rudin-Shapiro sequence, more exactly, of its alternating partial sums. (This latter one is oeis 020990). The picture …
10
votes
0answers
415 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 …
1
vote
3answers
338 views
Greatest Prime Factors: For any prime p, is there an integer C such that for any x >= C, all but 1 integer in the sequence x+1, x+2, …, x+p has a greatest prime factor > p.
I apologize if this is a naive question about greatest prime factors (gpf). I was thinking about the sequence of integers where $gpf(x) \le p$ where $p$ is any prime.
Clearly, as …
1
vote
1answer
157 views
Maximal difference between k randomly drawn numbers from 1 to n – Looking for formula to sequence
Hello!
I have an interesting problem that seemed simple to me, but I'm unable to solve it on my own.
Suppose I am drawing k numbers out of n numbers labeled from 1 to n.
Consideri …
18
votes
3answers
1k views
Zeroes of the random Fibonacci sequence
Let X_n be the "random Fibonacci sequence," defined as follows:
$X_0 = 0, X_1 = 1$;
$X_n = \pm X_{n-1} \pm X_{n-2}$, where the signs are chosen by independent 50/50 coinflips.
I …
2
votes
3answers
584 views
Which $n$ maximize $G(n)=\frac{\sigma(n)}{n \log \log n}$?
By Robin's theorem
$$G(n)=\frac{\sigma(n)}{n \log \log n}$$
is bounded by $e^\gamma \approx 1.78107241799$ for $n>5040$ assuming Riemann hypothesis .
For $n=\mathrm {lcm} (1,2 \ …
-3
votes
2answers
585 views
An interesting, simple, sequence - surprised to find little material. [closed]
I've been considering this sequence:
$$1,2,3,6,12,24,48,96,192,...$$
I've generated the sequence from the rule
$$V_n=\sum_{0\leq i \lt n} V_i$$
$$V_0=1; V_1=2V_0=V_0+V_0$$
Wha …
7
votes
11answers
1k views
Longest coinciding pair of integer sequences known
There are arbitrarily many pairs of integer sequences (of arbitrary origins) that coincide upto an $N$ but differ for an $n > N$. I assume, the coincidence will be considered accid …
1
vote
0answers
292 views
Can someone help me in a proof about Kolakoski sequence? [closed]
Hello everyone.
I am not a mathematician but recently I was thinking about one of Kimberling's questions he posted here: http://faculty.evansville.edu/ck6/integer/index.html , i.e …
6
votes
2answers
419 views
Maximal number of edges and triangular cells for n points in a triangular lattice
Consider a subset of $n$ points in an equilateral triangular lattice. Draw all the edges between nearest-neighbor points.
What is the maximum, over all such subsets, of the number …
7
votes
4answers
704 views
A Pascal’s-triangle -like random process
I was exploring Pascal's triangle on a cylinder when I encountered this puzzle-like problem.
It is surely elementary, but perhaps weekend-entertaining.
Start with a permutation of …
5
votes
5answers
582 views
Can an integer or rational sequence satisfy some bounded order recurrence $\mod \ $ almost all primes but doesn’t satisfy such in $\mathbb{Q}$?
Can an integer or rational sequence satisfy some bounded order recurrence $\mod \ $ almost all primes but doesn't satisfy such in $\mathbb{Q}$?
The recurrences $\mod p$ can be dif …
11
votes
0answers
508 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 …

