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.

A205398 s(k)-s(j), where (k,j) is the least pair for which n divides s(k)-s(j), and s(j)=ceiling(j^2/2).

This page as a plain text file.
%I A205398 #5 Mar 30 2012 18:58:11
%S A205398 1,4,3,4,5,6,7,8,27,10,11,12,13,14,30,16,17,36,19,20,42,22,23,24,25,
%T A205398 26,27,28,29,30,31,32,33,34,70,36,37,38,39,40,41,42,43,44,45,46,47,48,
%U A205398 49,100,102,52,53,54,110,56,57,58,59,60,61,62,63,64,130,66,67
%N A205398 s(k)-s(j), where (k,j) is the least pair for which n divides s(k)-s(j), and s(j)=ceiling(j^2/2).
%C A205398 For a guide to related sequences, see A204892.
%t A205398 (See the program at A205394.)
%Y A205398 Cf. A205394, A204892.
%K A205398 nonn
%O A205398 1,2
%A A205398 _Clark Kimberling_, Jan 27 2012