The first term of a sequence is $2014$. Each succeeding term is the sum of the cubes of the digits of the previous term. What is the $2014$ th term of the sequence?

Consider the sequence of six real numbers 60, 10, 100, 150, 30, and $x$. The average (arithmetic mean) of this sequence is equal to the median of the sequence. What is the sum of all the possible values of $x$? (The median of a sequence of six real numbers is the average of the two middle numbers after all the numbers have been arranged in increasing order.)

Let $(a_n)_{n\ge 1}$ be a sequence given by $a_1 = 45$ and $$a_n = a^2_{n-1} + 15a_{n-1}$$ for $n > 1$. Prove that the sequence contains no perfect squares.

$w(x)$ is a polynomial with integer coefficients. Let $p_n$ be the sum of the digits of the number $w(n)$. Show that some value must occur infinitely often in the sequence $p_1, p_2, p_3, ...$ .

Let $a\le 1$ be a real number. Sequence $\{x_n\}$ satisfies $x_0=0, x_{n+1}= 1-a\cdot e^{x_n}$, for all $n\ge 1$, where $e$ is the natural logarithm. Prove that for any natural $n$, $x_n\ge 0$.

The sequence $ a_n$ satisfies $ a_{m\plus{}n}\plus{} a_{m\minus{}n}\equal{}\frac12(a_{2m}\plus{}a_{2n})$ for all $ m\geq n\geq 0$. If $ a_1\equal{}1$, find $ a_{1995}$.

Give a geometric series $(a_n)$ with common ratio of $q$, let $b_1=a_1+a_2+a_3,b_2=a_4+a_5+a_6,\cdots,b_n=a_{3n}+a_{3n+1}+a_{3n+2}$, then sequence $(b_n)$ $\text{(A)}$ is an arithmetic sequence $\text{(B)}$ is a geometric series with common ratio of $q$ $\text{(C)}$ is a geometric series with common ratio of $q^3$ $\text{(D)}$ is neither an arithmetic sequence nor a geometric series

An infinite sequence $ \,x_{0},x_{1},x_{2},\ldots \,$ of real numbers is said to be [b]bounded[/b] if there is a constant $ \,C\,$ such that $ \, \vert x_{i} \vert \leq C\,$ for every $ \,i\geq 0$. Given any real number $ \,a > 1,\,$ construct a bounded infinite sequence $ x_{0},x_{1},x_{2},\ldots \,$ such that \[ \vert x_{i} \minus{} x_{j} \vert \vert i \minus{} j \vert^{a}\geq 1 \] for every pair of distinct nonnegative integers $ i, j$.

Given a string of at least one character in which each character is either A or B, Kathryn is allowed to make these moves: [list] [*] she can choose an appearance of A, erase it, and replace it with BB, or [*] she can choose an appearance of B, erase it, and replace it with AA. [/list] Kathryn starts with the string A. Let $a_n$ be the number of strings of length $n$ that Kathryn can reach using a sequence of zero or more moves. (For example, $a_1=1$, as the only string of length 1 that Kathryn can reach is A.) Then $\sum_{n=1}^{\infty} \frac{a_n}{5^n} = \frac{m}{n}$, where $m$ and $n$ are positive integers with $\gcd(m,n)=1$. Compute $100m+n$. [i]Proposed by Luke Robitaille[/i]

Let $a,b,c$ be 3 integers, $b$ odd, and define the sequence $\{x_n\}_{n\geq 0}$ by $x_0=4$, $x_1=0$, $x_2=2c$, $x_3=3b$ and for all positive integers $n$ we have \[ x_{n+3} = ax_{n-1}+bx_n + cx_{n+1} . \] Prove that for all positive integers $m$, and for all primes $p$ the number $x_{p^m}$ is divisible by $p$.

Let $ p$ be a positive integer. Define the function $ f: \mathbb{N}\to\mathbb{N}$ by $ f(n)\equal{}a_1^p\plus{}a_2^p\plus{}\cdots\plus{}a_m^p$, where $ a_1, a_2,\ldots, a_m$ are the decimal digits of $ n$ ($ n\equal{}\overline{a_1a_2\ldots a_m}$). Prove that every sequence $ (b_k)^\infty_{k\equal{}0}$ of positive integer that satisfy $ b_{k\plus{}1}\equal{}f(b_k)$ for all $ k\in\mathbb{N}$, has a finite number of distinct terms. $ \mathbb{N}\equal{}\{1,2,3\ldots\}$

We call a sequence of $m$ consecutive integers a [i]friendly[/i] sequence if its first term is divisible by $1$, the second by $2$, ..., the $(m-1)^{th}$ by $m-1$, and in addition, the last term is divisible by $m^2$ Does a friendly sequence exist for (a) $m=20$ and (b) $m=11$?

Call a sequence of positive integers $(a_n)_{n \ge 1}$ a "CGMO sequence" if $(a_n)_{n \ge 1}$ strictly increases, and for all integers $n \ge 2022$, $a_n$ is the smallest integer such that there exists a non-empty subset of $\{a_{1}, a_{2}, \cdots, a_{n-1} \}$ $A_n$ where $a_n \cdot \prod\limits_{a \in A_n} a$ is a perfect square. Proof: there exists $c_1, c_2 \in \mathbb{R}^{+}$ s.t. for any "CGMO sequence" $(a_n)_{n \ge 1}$ , there is a positive integer $N$ that satisfies any $n \ge N$, $c_1 \cdot n^2 \le a_n \le c_2 \cdot n^2$.

The sequence $a_n$ is defined for any $n\geq 10$ by the following inductive rule: [list] [*] $a_{10}=5778$ [*] If $a_n=0$ then $a_{n+1}=0$. [*] If $a_n\neq0$ then $a_{n+1}$ is the number whose base-$(n+1)$ representation equals the base $n$ representation of the number $a_n -1$. [/list] For example, $a_{11}=5\cdot11^3+7\cdot11^2+7\cdot11^1+7\cdot11^0=7586$ $a_{12}=5\cdot12^3+7\cdot12^2+7\cdot12^1+6\cdot12^0=9738$ [list=a] [*] Does there exist $n\geq10$ for which $a_n=0$? [*] Is $a_{1,000,000}=0$? [*] Is $a_{100^{100^{100}}}=0$? [/list]

Find all positive integers $n$ that have distinct positive divisors $d_1, d_2, \dots, d_k$, where $k>1$, that are in arithmetic progression and $$n=d_1+d_2+\cdots+d_k.$$ Note that $d_1, d_2, \dots, d_k$ do not have to be all the divisors of $n$.