login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097017 a(n) = sigma(5*n) modulo 6. 1

%I #19 Jan 14 2019 17:41:17

%S 0,0,0,0,1,0,0,0,0,3,0,0,0,0,4,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,

%T 2,0,0,0,0,3,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,2,0,0,0,

%U 0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,3,0,0,0,0,2,0,0,0,0,0,0,0,0,0,2

%N a(n) = sigma(5*n) modulo 6.

%C a(n) = 0 if A112765(n) is even. - _Robert Israel_, Feb 27 2018

%H Robert Israel, <a href="/A097017/b097017.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A084301(5*n).

%p f:= n -> numtheory:-sigma(5*n) mod 6;

%p map(f, [$1.100]); # _Robert Israel_, Feb 27 2018

%t Mod[#,6]&/@DivisorSigma[1,5*Range[110]] (* _Harvey P. Dale_, Jan 14 2019 *)

%o (PARI) a(n) = sigma(5*n) % 6; \\ _Michel Marcus_, Mar 08 2014

%Y Cf. A000203, A084301, A112765.

%K nonn

%O 1,10

%A _Labos Elemer_, Aug 23 2004

%E Definition clarified by _Harvey P. Dale_, Jan 14 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 5 02:46 EDT 2024. Contains 372257 sequences. (Running on oeis4.)