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.

A205390 s(k)-s(j), where (k,j) is the least pair for which n divides s(k)-s(j), and s(j)=(1/2)C(2j,j).

This page as a plain text file.
%I A205390 #7 Dec 25 2023 18:15:57
%S A205390 2,2,9,32,25,336,7,32,9,1590,1254,336,91,336,1590,32,34,24300,1254,
%T A205390 6400,336,1254,92368,336,25,22594,459,336,116,1590,260338,32,1254,34,
%U A205390 1715,24300,24309,1254,4719,6400,123,336,57500460,23848,24300
%N A205390 s(k)-s(j), where (k,j) is the least pair for which n divides s(k)-s(j), and s(j)=(1/2)C(2j,j).
%C A205390 For a guide to related sequences, see A204892.
%t A205390 (See the program at A205386.)
%Y A205390 Cf. A205386, A204892.
%K A205390 nonn
%O A205390 1,1
%A A205390 _Clark Kimberling_, Jan 27 2012