Skip to main content
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
Results tagged with
Search options questions only not deleted user 4556

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

1 vote
0 answers
57 views

Curious congruences modulo $4$ involving primes

We define $$S(n)=\sum_{a=2+(n\pmod 2)}^{n-2} \sharp(\{j,1\leq j<n \pmod{a},(a,j)=1\})\ .$$ (Searching the OEIS yielded no results.) For $n>2$ we have the following experimental observations (checked …
Roland Bacher's user avatar
2 votes
1 answer
274 views

Curious sequences of polynomials

Given an integer $k\geq 2$, and $k+1$ invertible initial values $s_0,s_1,\ldots,s_k$ in some commutative ring $\mathcal A$ we set $$s_{n+1}=\frac{\sum_{j=1}^ks_{n+1-j}^2+q \sum_{j=1}^{k-1}s_{n+1-j}s_{ …
Roland Bacher's user avatar
2 votes
1 answer
177 views

An upper bound on coefficients of some integer sequences

Given $\lambda>0$ let $B=B(\lambda)$ be the smallest integer such that there exist infinite integer sequences having values in $\lbrace 1,2,\ldots,B-1,B\rbrace$ and satisfying the following property: …
Roland Bacher's user avatar
4 votes
0 answers
155 views

The smallest sequence without differences among Fibonacci numbers

Given a subset $\mathcal S\subset \mathbb N\setminus\{0\}$ of (strictly) positive integers, we can consider subsets $A$ of $\mathbb N$ (or $\mathbb Z$) with no differences in $\mathcal S$. Examples: I …
Roland Bacher's user avatar
6 votes
1 answer
220 views

Sequence A76132 eventually periodic modulo $2,3$ and $5$

Sequence A76132 starting as $1,1,2,4,10,36,218,\ldots$ of the OEIS is recursively defined by $a(1)=1$ and $a(n)=\sum_{k=1}^{n-1}a(n-k)^k$ for $n\geq 2$. It is eventually periodic of period 1,1 and 34 …
Roland Bacher's user avatar
3 votes
0 answers
86 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 …
Roland Bacher's user avatar