OFFSET
0,4
COMMENTS
A strong divisibility sequence, that is, gcd(a(n),a(m)) = a(gcd(n,m)) for n,m >= 1. It follows that a(n) is a divisibility sequence: if n divides m then a(n) divides a(m). - Peter Bala, Feb 17 2019
LINKS
Muniru A Asiru, Table of n, a(n) for n = 0..5000
Wikipedia, Quasi-polynomial.
Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,-1).
FORMULA
From R. J. Mathar, Apr 18 2011: (Start)
a(n) = A109051(n)/10.
Dirichlet g.f.: zeta(s-1)*(1 - 4/5^s - 1/2^s + 4/10^s).
Multiplicative with a(2^e) = 2^max(0,e-1), a(5^e) = 5^max(0,e-1), a(p^e) = p^e if p = 3 or p >= 7. (End)
From Peter Bala, Feb 17 2019: (Start)
a(n) = numerator(n/((n + 2)*(n + 5))).
a(n) = n/b(n), where b(n) = [1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, ...] is a purely periodic sequence of period 10. Thus a(n) is a quasi-polynomial in n.
If gcd(n,m) = 1 then a( a(n)*a(m) ) = a(a(n)) * a(a(m)), a( a(a(n))*a(a(m)) ) = a(a(a(n))) * a(a(a(m))) and so on.
O.g.f.: Sum_{d divides 10} A023900(d)*x^d/(1 - x^d)^2 = x/(1 - x)^2 - x^2/(1 - x^2)^2 - 4*x^5/(1 - x^5)^2 + 4*x^10/(1 - x^10)^2.
(End)
Sum_{k=1..n} a(k) ~ (63/200) * n^2. - Amiram Eldar, Nov 25 2022
MATHEMATICA
f[n_]:=Numerator[n/(n+10)]; Array[f, 100, 0] (* Vladimir Joseph Stephan Orlovsky, Feb 17 2011 *)
PROG
(Sage) [lcm(n, 10)/10 for n in range(0, 79)] # Zerinvary Lajos, Jun 07 2009
(Magma) [Numerator(n/(n+10)): n in [0..100]]; // Vincenzo Librandi, Apr 18 2011
(GAP) List([0..80], n->NumeratorRat(n/(n+10))); # Muniru A Asiru, Feb 18 2019
CROSSREFS
KEYWORD
nonn,easy,frac,mult
AUTHOR
N. J. A. Sloane, May 15 2005
STATUS
approved