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 #12 Jul 04 2022 09:31:58
%S 1,4,8,16,18,19,40,50,63,66,80,109,128,155,227,282,297,373,460,508,
%T 561,644,691,810,930,1005,1198,1213,1482,1779,1902,2033,2296,3011,
%U 3223,3305,4134,5086,5100,5839,5943,5950,7631,8273,8459,10331,10871,10979,11314,11350
%N Record entries in A065191.
%H Charlie Neder, <a href="/A065192/b065192.txt">Table of n, a(n) for n = 1..77</a>
%t nmax = 20000;
%t A065191 = Reap[Do[pos = n; Do[pos -= k (-1)^Quotient[pos, k], {k, n, 1, -1}]; pos -= If[Mod[n, 4] < 2, 1, -1]; Sow[pos], {n, 1, nmax}]][[2, 1]];
%t record = 0;
%t Reap[For[k = 1, k <= nmax, k++, If[A065191[[k]] > record, record = A065191[[k]]; Sow[record]]]][[2, 1]] (* _Jean-François Alcover_, Jul 04 2022 *)
%Y Cf. A065191, A065193, A065194, A065195, A065196, A065197.
%K nice,nonn
%O 1,2
%A Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Oct 19 2001
%E Extended by _Charlie Neder_, Feb 04 2019