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 Nov 18 2022 03:39:39
%S 1,2,5,10,17,22,28,35,59,60,69,70,71,72,81,84,85,94,97,98,99,100,101,
%T 110,113,115,116,117,118,119,128,131,133,134,135,136,137,139,148,151,
%U 153,154,155,156,157,158,160,161,162,171,174
%N Numbers k such that A030717(k) = 1.
%H Seiichi Manyama, <a href="/A030723/b030723.txt">Table of n, a(n) for n = 1..10000</a>
%H Michael De Vlieger, <a href="/A030723/a030723.png">Plot a(w(j) + k - 1) at (j,k)</a> for j = 1..512 and w the sequence of partial sums of A030719, showing a(m) = 1 in red and a(m) > 1 in light blue.
%t nn = 102; c[_] = 0; m = k = a[1] = c[1] = 1; {1}~Join~Reap[Do[w = Union@ Array[a, k]; Do[If[Set[a[j + k], c[w[[j]]]] == 1, Sow[j + k]], {j, Length[w]}]; Do[c[a[j + k]]++, {j, Length[w]}]; k += Length[w], {nn}]][[-1, -1]] (* _Michael De Vlieger_, Nov 15 2022 *)
%Y Cf. A030717, A030724, A030725, A030726.
%K nonn
%O 1,2
%A _Clark Kimberling_