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!)
A076239 Remainder when 3rd-order composite ccc(n) = A050436(n) is divided by n. 5
0, 1, 1, 2, 3, 3, 1, 6, 3, 2, 4, 1, 11, 10, 10, 8, 6, 6, 7, 8, 6, 4, 3, 2, 2, 0, 26, 0, 0, 28, 28, 29, 28, 27, 28, 28, 30, 29, 28, 30, 29, 31, 31, 30, 29, 29, 28, 28, 27, 26, 28, 29, 29, 30, 30, 29, 31, 30, 29, 32, 31, 30, 29, 28, 29, 28, 27, 26, 26, 25, 26, 26, 26, 26, 26, 28, 29 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
a(n) = ccc(n) mod n = A050436(n) mod n.
MATHEMATICA
MapIndexed[Mod[#1, First@ #2] &, #] &@ Nest[Values@ KeySelect[ MapIndexed[ First@ #2 -> #1 &, #], CompositeQ] &, Select[Range@ 183, CompositeQ], 2] (* Michael De Vlieger, Jul 22 2017 *)
CROSSREFS
Sequence in context: A138677 A193885 A364957 * A019798 A214734 A120653
KEYWORD
nonn
AUTHOR
Labos Elemer, Oct 08 2002
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 March 29 05:48 EDT 2024. Contains 371265 sequences. (Running on oeis4.)