The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A084303 Smallest x such that sigma(x) mod 6 = n. 5
5, 1, 7, 2, 3, 2401 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Row 6 of A074625 (apart from different ordering). - Michel Marcus, Dec 19 2013
LINKS
EXAMPLE
n=5: sigma(2401) = 1+7+49+343+2401 = 2801 = 6*466+5, hence a(5)=2401.
MATHEMATICA
Table[k = 1; While[Mod[DivisorSigma[1, k], 6] != n, k++]; k, {n, 0, 5}] (* Michael De Vlieger, Mar 25 2017 *)
PROG
(PARI) a(n) = {my(x = 1); while((sigma(x) % 6) != n, x++); x; } \\ Michel Marcus, Dec 18 2013
CROSSREFS
Sequence in context: A102778 A135544 A051724 * A011508 A365318 A195429
KEYWORD
easy,fini,full,nonn
AUTHOR
Labos Elemer, Jun 02 2003
STATUS
approved

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 14 04:29 EDT 2024. Contains 372528 sequences. (Running on oeis4.)