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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076237 Remainder when 2nd order composite cc[n]=A050435[n] is divided by n. 3
0, 0, 0, 0, 3, 3, 3, 1, 8, 8, 10, 9, 8, 8, 8, 7, 6, 6, 7, 8, 7, 6, 5, 4, 5, 4, 3, 4, 5, 4, 3, 4, 3, 2, 2, 2, 2, 1, 0, 0, 40, 0, 0, 43, 43, 44, 44, 45, 45, 45, 47, 48, 49, 50, 50, 50, 53, 53, 53, 55, 55, 55, 55, 55, 56, 56, 56, 56, 56, 56, 57, 58, 59, 59, 60, 62, 63, 63, 64, 65, 65, 65, 67 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
FORMULA
a(n) = Mod[cc[n], n] = Mod[A050435(n), n]
MATHEMATICA
Module[{cmps=Select[Range[300], CompositeQ], c2}, c2=Table[cmps[[cmps[[n]]]], {n, 100}]; Mod[#[[1]], #[[2]]]&/@Thread[{c2, Range[Length[c2]]}]] (* Harvey P. Dale, May 02 2022 *)
CROSSREFS
Sequence in context: A243095 A304586 A155969 * A201432 A128210 A215409
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 December 4 05:52 EST 2023. Contains 367541 sequences. (Running on oeis4.)