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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A285736 a(n) = A285735(n) - A285734(n) = n - 2*A285734(n). 3
 1, 0, 1, 0, 1, 0, 3, 2, 3, 0, 1, 0, 1, 0, 5, 4, 3, 4, 7, 0, 1, 0, 3, 2, 3, 0, 1, 0, 1, 0, 3, 2, 5, 0, 7, 2, 7, 0, 5, 2, 3, 0, 1, 0, 1, 0, 5, 4, 3, 8, 7, 0, 7, 8, 3, 4, 5, 0, 1, 0, 1, 0, 3, 2, 3, 0, 1, 0, 1, 0, 3, 2, 3, 0, 1, 0, 1, 0, 3, 2, 3, 0, 1, 0, 1, 0, 5, 4, 3, 4, 15, 0, 1, 0, 11, 10, 5, 4, 7, 6, 9, 0, 11, 2, 11, 0, 15, 2, 7, 0, 5, 2, 3, 0, 1, 0, 1, 0, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,7 LINKS Antti Karttunen, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A285735(n) - A285734(n) = n - 2*A285734(n). PROG (Scheme) (define (A285736 n) (- (A285735 n) (A285734 n))) (define (A285736 n) (- n (* 2 (A285734 n)))) (Python) from sympy.ntheory.factor_ import core def issquarefree(n): return core(n) == n def a285734(n):     if n==1: return 0     j=n//2     while True:         if issquarefree(j) and issquarefree(n - j): return j         else: j-=1 def a285736(n): return n - 2*a285734(n) print([a285736(n) for n in range(1, 101)]) # Indranil Ghosh, May 02 2017 CROSSREFS Cf. A005117 (2*A005117 gives the positions of zeros), A285734, A285735. Sequence in context: A016458 A058513 A319650 * A325142 A047160 A332497 Adjacent sequences:  A285733 A285734 A285735 * A285737 A285738 A285739 KEYWORD nonn AUTHOR Antti Karttunen, May 02 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 14 05:20 EDT 2022. Contains 356110 sequences. (Running on oeis4.)