reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
In addition to being multiplicative, a(n) is a strong divisibility sequence, that is, gcd(a(n),a(m)) = a(gcd(n,m)) for n >= 1, m >= 1. In particular, a(n) is a divisibility sequence: if n divides m then a(n) divides a(m). - Peter Bala, Feb 21 2019
proposed
editing
editing
proposed
nonn,easy,frac,mult,changed
Apart from 0, also numerator of sumSum_{i=1..n} (1/((i+2)*(i+3)), i=1..n) = n/(3n+9). - Bruno Berselli, Nov 07 2012
Raffaello Giusti, editore, Supplemento al Periodico di Matematica (Livorno), Jul 1902. , p. 138 (Problem 421, case k=3).
"Raffaello Giusti, editore, Supplemento al Periodico di Matematica", Raffaello Giusti Editore (Livorno), Jul 1902 . p. 138 (Problem 421, case k=3).
P. Peter Bala, <a href="/A306367/a306367.pdf">A note on the sequence of numerators of a rational function </a>, 2019.
Multiplicative with a(3^e) = 3^max(0,e-2), a(p^e) = p^e if p<>3. - R. J. Mathar, Apr 18 2011
Dirichlet g.f. zeta(s-1)*(1-2/3^s-2/9^s). (End)
Multiplicative with a(3^e) = 3^max(0,e-2), a(p^e) = p^e if p<>3. (End)