login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

a(n) = (1/n)*A205406(n).
3

%I #18 Dec 07 2021 11:09:47

%S 1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,

%T 1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,3,1,

%U 1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,3

%N a(n) = (1/n)*A205406(n).

%C For a guide to related sequences, see A204892.

%H Paolo Xausa, <a href="/A198293/b198293.txt">Table of n, a(n) for n = 1..20000</a>

%t (See the program at A205402.)

%t s[m_]:=s[m]=Floor[(m+1)^2/2]/2

%t A205406[n_]:=(k=2;found=False;While[!found,Do[If[Mod[d=s[k]-s[j],n]==0,found=True;Break[]],{j,k-1}];k++];d)

%t nterms=100;Table[A205406[n]/n,{n,nterms}] (* _Paolo Xausa_, Dec 03 2021 *)

%o (PARI)

%o A002620(n) = ((n^2)>>2);

%o A002620shiftedleft(n) = A002620(1+n);

%o A205406(n) = { my(d); for(k=2,oo, for(j=1,k-1,if(!((d=A002620shiftedleft(k)-A002620shiftedleft(j))%n),return(d)))); };

%o A198293(n) = (A205406(n)/n); \\ _Antti Karttunen_, Dec 03 2021

%Y Cf. A002620, A205402, A205406, A204892.

%K nonn

%O 1,9

%A _Clark Kimberling_, Jan 27 2012

%E Data section extended up to a(111) by _Antti Karttunen_, Dec 03 2021