Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
For questions about sequences of integers. References are often made to the online resource oeis.org.
7
votes
1
answer
285
views
On nontotient Fibonacci numbers
This question is related to sequence of numbers $t$ such that $F_{6t}$ is a nontotient where $F_n$ represents the sequence of Fibonacci numbers for $n\geq 0$.
The online encyclopedia Wikipedia has the …
32
votes
0
answers
2k
views
A question related to the Hofstadter–Conway \$10000 sequence
The Hofstadter–Conway \$10000 sequence is defined by the nested recurrence relation $$c(n) = c(c(n-1)) + c(n-c(n-1))$$ with $c(1) = c(2) = 1$. This sequence is A004001 and it is well-known that this s …
6
votes
0
answers
286
views
Does $a_{i}(n)$ hit every positive integers infinitely many times for all $i\ge1$?
This question is related to a family of sequences. I have a simple definition as below and I have a question based on my limited observations for $i\le200$ and $n \le 10^{9}$.
Definition. $a_{i}(1) = …
2
votes
0
answers
176
views
A question on $a_i(n) = a_i(\pi(n)) + a_i(n-\pi(n))$ with $a_i(n) = 1$ for $n \le i$
Let $a_i(n) = a_i(\pi(n)) + a_i(n-\pi(n))$ with $a_i(n) = 1$ for $n \le i$ where $\pi(n)$ is the prime-counting function.
By definition, it is obvious that $a_1(n) = n$ and $a_2(n)$ is https://oeis.or …
6
votes
0
answers
284
views
Is there a positive odd $n$ such that $\sigma(\sigma(n)) = \sigma(\sigma(n)-n)+\sigma(n)$?
Let $\sigma(n)$ denote the sum of the divisors of $n$. (https://oeis.org/A000203)
It is relatively easy to find numbers $n$ such that $f(g(n)) = g(f(n))$ where $f(n) = \sigma(n)$ and $g(n) = \sigma(n) …
4
votes
0
answers
300
views
On $\sum_{k=1}^nk^3 = x^3 + y^3$ with $x,y \ge 1$
My question is related to https://oeis.org/A269839.
It is well-known that there are parametric families of solutions for cubes that are sums of consecutive cubes: https://arxiv.org/pdf/1603.08901.pdf. …
2
votes
2
answers
396
views
Why are attempts to define chaos with discrete states so scarce?
Interestingly, the theory of nested recurrence relations has been correlated with “discrete chaos” by Golomb (1991) and Tanny (1992).
And in literature, there are very few studies that have different …