|
%I #11 Nov 06 2018 21:18:12
%S 4,2,2,1,2,1,2,1,2,1,2,2,2,1,2,1,2,1,2,2,2,1,2,1,2,1,2,1,2,1,2,1,2,1,
%T 2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,2,2,1,2,1,2,1,2,1,2,1,2,1,
%U 2,1,2,2,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2
%N a(n) = (s(k)-s(j))/n, where (s(k),s(j)) is the least pair of oblong numbers (A002378) for which n divides their difference; a(n) = (1/n)*A205031(n).
%C For a guide to related sequences, see A204892.
%C Even n such that a(n) = 2 are: 2, 12, 20, 56, 72, 132, 156, 240, 272, 380, 552, 812, 992, 1056, 1332, 1640, 1892, 2256, 2756, 3540, 3660, 4032, 4160, 4556, 5112, 5256, 6320, 6972, 7656, 7832, ... - _Antti Karttunen_, Nov 06 2018
%H Antti Karttunen, <a href="/A205032/b205032.txt">Table of n, a(n) for n = 1..14025</a>
%t (See the program at A205018.)
%o (PARI) A205032(n) = for(k=2,oo,my(sk=k*(k+1)); for(j=1,k-1,if(!((sk-((j+1)*j))%n),return((sk-((j+1)*j))/n)))); \\ _Antti Karttunen_, Nov 06 2018
%o (PARI) A205032(n) = for(k=sqrtint(n)-1,oo,my(sk=k*(k+1), d); for(j=1,k-1,d=(sk-((j+1)*j)); if(0==(d%n),return(d/n),if(d<n,break)))); \\ _Antti Karttunen_, Nov 06 2018
%Y Cf. A002378, A205018, A205031, A204892.
%Y Cf. also A204897, A204999, A205007.
%K nonn
%O 1,1
%A _Clark Kimberling_, Jan 22 2012
%E Definition edited and more terms from _Antti Karttunen_, Nov 06 2018
|
