|
%I #18 Dec 13 2017 02:46:13
%S 0,2,3,2,5,5,0,2,3,7,0,5,0,2,8,2,0,5,0,7,3,2,0,5,5,2,3,2,0,10,0,2,3,2,
%T 5,5,0,2,3,7,0,5,0,2,8,2,0,5,0,7,3,2,0,5,5,2,3,2,0,10,0,2,3,2,5,5,0,2,
%U 3,7,0,5,0,2,8,2,0,5,0,7,3,2,0,5,5,2,3,2,0,10,0,2,3,2,5,5,0,2,3,7,0,5,0,2,8
%N Sum of divisors d of n which are d=2, 3 or 5.
%C The sequence is periodic with period length 30.
%H G. C. Greubel, <a href="/A178144/b178144.txt">Table of n, a(n) for n = 1..10000</a>
%H V. Shevelev, <a href="http://arXiv.org/abs/0903.1743">A recursion for divisor function over divisors belonging to a prescribed finite sequence of positive integers and a solution of the Lahiri problem for divisor function sigma_x(n)</a>, arXiv:0903.1743 [math.NT], 2009.
%H <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (-2,-2,-1,0,1,2,2,1).
%F a(n) = -2*a(n-1) -2*a(n-2) -a(n-3) +a(n-5) +2*a(n-6) +2*a(n-7) +a(n-8). _R. J. Mathar_, Jul 23 2012
%F G.f.: ( -x*(2+7*x+12*x^2+17*x^3+22*x^4+10*x^6+20*x^5) ) / ( (x-1)*(1+x)*(1+x+x^2)*(x^4+x^3+x^2+x+1) ). - _R. J. Mathar_, Jul 23 2012
%p A178144 := proc(n)
%p local a;
%p a := 0 ;
%p for d in {2,3,5} do
%p if (n mod d) = 0 then
%p a := a+d ;
%p end if;
%p end do:
%p a ;
%p end proc: # _R. J. Mathar_, Jul 23 2012
%t a[n_] := DivisorSum[n, Boole[MatchQ[#, 2|3|5]]*#&];
%t Array[a, 105] (* _Jean-François Alcover_, Nov 24 2017 *)
%o (PARI) a(n) = sumdiv(n, d, if ((d==2) || (d==3) || (d==5), d)); \\ _Michel Marcus_, Nov 24 2017
%Y Cf. A000203, A008472, A178143, A171182, A178142.
%K nonn,easy
%O 1,2
%A _Vladimir Shevelev_, May 21 2010
|
