This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A284552 a(n) = A065621(n) modulo n. 2
 0, 0, 1, 0, 3, 2, 4, 0, 7, 6, 9, 4, 8, 8, 4, 0, 15, 14, 17, 12, 19, 18, 13, 8, 16, 16, 20, 16, 8, 8, 4, 0, 31, 30, 33, 28, 35, 34, 29, 24, 39, 38, 41, 36, 27, 26, 21, 16, 32, 32, 36, 32, 40, 40, 36, 32, 16, 16, 20, 16, 8, 8, 4, 0, 63, 62, 65, 60, 67, 66, 61, 56, 71, 70, 73, 68, 59, 58, 53, 48, 79, 78, 81, 76, 83, 82, 77, 72, 55, 54, 57, 52, 43, 42 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS Antti Karttunen, Table of n, a(n) for n = 1..8192 FORMULA a(n) = A065621(n) modulo n. PROG (Scheme) (define (A284552 n) (modulo (A065621 n) n)) CROSSREFS Column 1 of A284270. Cf. A065621. Sequence in context: A127099 A004545 A127481 * A154879 A097673 A226377 Adjacent sequences:  A284549 A284550 A284551 * A284553 A284554 A284555 KEYWORD nonn,base AUTHOR Antti Karttunen, Apr 10 2017 STATUS approved

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

Last modified April 21 20:59 EDT 2019. Contains 322328 sequences. (Running on oeis4.)