cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A205006 a(n) = s(k)-s(j), where (s(k),s(j)) is the least pair of distinct triangular numbers for which n divides their difference.

This page as a plain text file.
%I A205006 #10 Sep 28 2018 10:30:35
%S A205006 2,2,3,4,5,12,7,8,9,20,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,
%T A205006 26,27,56,29,30,31,32,33,34,35,72,37,38,39,40,41,42,43,44,45,46,47,48,
%U A205006 49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,132,67,68,69,70,71,72,73,74,75,76,77,156,79,80,81
%N A205006 a(n) = s(k)-s(j), where (s(k),s(j)) is the least pair of distinct triangular numbers for which n divides their difference.
%C A205006 For a guide to related sequences, see A204892.
%H A205006 Antti Karttunen, <a href="/A205006/b205006.txt">Table of n, a(n) for n = 1..23515</a>
%t A205006 (See the program at A205002.)
%o A205006 (PARI) A205006(n) = for(k=2,oo,my(sk=binomial(k+1,2)); for(j=1,k-1,if(!((sk-binomial(j+1,2))%n),return(sk-binomial(j+1,2))))); \\ _Antti Karttunen_, Sep 27 2018
%Y A205006 Cf. A000217, A205002, A205007, A204892.
%Y A205006 Cf. A318894 (gives the positions where a(n) is not n).
%K A205006 nonn
%O A205006 1,1
%A A205006 _Clark Kimberling_, Jan 21 2012
%E A205006 More terms from _Antti Karttunen_, Sep 27 2018