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.
%I A205385 #7 Dec 25 2023 18:16:54 %S A205385 1,1,2,5,6,15,3,5,2,20,21,15,10,15,20,5,4,31,21,25,15,21,39,15,6,35, %T A205385 12,15,9,20,55,5,21,4,16,31,29,21,28,25,8,15,105,34,31,39,71,15,16,25 %N A205385 Least h such that n divides the h-th difference between distinct numbers (1/2)C(2j,j), as ordered in A205384. %C A205385 For a guide to related sequences, see A204892. %t A205385 (See the program at A205386.) %Y A205385 Cf. A205386, A204892. %K A205385 nonn %O A205385 1,3 %A A205385 _Clark Kimberling_, Jan 27 2012