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

 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!)
 A220235 (2^n + 3^n) modulo n. 3
 0, 1, 2, 1, 0, 1, 5, 1, 8, 3, 5, 1, 5, 13, 5, 1, 5, 1, 5, 17, 14, 13, 5, 1, 0, 13, 26, 13, 5, 13, 5, 1, 2, 13, 30, 1, 5, 13, 35, 17, 5, 37, 5, 9, 35, 13, 5, 1, 12, 23, 35, 45, 5, 1, 0, 41, 35, 13, 5, 37, 5, 13, 35, 1, 15, 1, 5, 29, 35, 13, 5, 1, 5, 13, 50 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS a(n) = (A015910(n) + A066601(n)) mod n. a(n) = 0 at n = 1, 5, 25, 55, 125, 275, 605, 625, ... (A045576). LINKS Zak Seidov, Table of n, a(n) for n = 1..1000 MATHEMATICA Table[Mod[2^n + 3^n, n], {n, 100}] CROSSREFS Cf. A015910 (2^n mod n), A066601 (3^n mod n), A045576 (n|(2^n + 3^n)). Sequence in context: A210872 A360753 A292973 * A066603 A263339 A244372 Adjacent sequences: A220232 A220233 A220234 * A220236 A220237 A220238 KEYWORD nonn AUTHOR Zak Seidov, Dec 08 2012 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.

Last modified December 5 23:11 EST 2023. Contains 367594 sequences. (Running on oeis4.)