OFFSET
1,1
COMMENTS
This sequence is the subject of the 4th problem, proposed by Poland, of the 46th International Mathematical Olympiad in 2005 at Mérida (Mexico) [see the link IMO].
Answer to the question: 1 is the only positive integer that is relatively prime to every term of the sequence.
Proof: p=2 divides a(1) = 10, p=3 divides a(2) = 48, and if p prime >= 5, then p divides a(p-2). So, for every prime p, there exists n >= 1 such that p divides a(n).
LINKS
Colin Barker, Table of n, a(n) for n = 1..1000
IMO, IMO 2005 - Problem 4
Index entries for linear recurrences with constant coefficients, signature (12,-47,72,-36).
FORMULA
From Colin Barker, Dec 04 2019: (Start)
G.f.: 2*x*(5 - 36*x + 72*x^2 - 36*x^3) / ((1 - x)*(1 - 2*x)*(1 - 3*x)*(1 - 6*x)).
a(n) = 12*a(n-1) - 47*a(n-2) + 72*a(n-3) - 36*a(n-4) for n>5.
(End)
EXAMPLE
a(9) = 2^9 + 3^9 + 6^9 - 1 = 10097890 = 11 * 917990.
MAPLE
A330170 := seq(2^n+3^n+6^n-1, n=1..50);
MATHEMATICA
Table[2^n + 3^n + 6^n - 1, {n, 1, 21}] (* Amiram Eldar, Dec 04 2019 *)
PROG
(PARI) Vec(2*x*(5 - 36*x + 72*x^2 - 36*x^3) / ((1 - x)*(1 - 2*x)*(1 - 3*x)*(1 - 6*x)) + O(x^40)) \\ Colin Barker, Dec 04 2019
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Bernard Schott, Dec 04 2019
STATUS
approved