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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Mar 14 2017 00:26:12
%S 0,-1,0,-1,0,0,0,-1,0,0,2,0,1,0,0,-1,0,0,1,0,0,2,3,0,0,2,0,0,2,0,0,-1,
%T 0,0,2,0,2,2,4,4,6,0,1,4,3,6,5,0,0,2,2,4,4,0,6,2,2,2,4,0,1,0,0,-1,0,0,
%U 1,0,4,4,1,0,3,2,3,4,5,8,2,0,4,10,6,0,8,6,10,4
%N Remainder when n is divided by A004074(n), or -1 if A004074(n) = 0.
%H Altug Alkan, <a href="/A283497/b283497.txt">Table of n, a(n) for n = 1..10000</a>
%H Altug Alkan, <a href="/A283497/a283497.png">Illustration of A283497</a>
%F a(2^n) = -1 for n > 0.
%e a(11) = 2 because remainder when 11 is divided by A004074(11) = 3 is 2.
%Y Cf. A004001, A004074.
%K sign
%O 1,11
%A _Altug Alkan_, Mar 11 2017