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.

A204913 Least k such that n divides the k-th difference between distinct double factorials.

This page as a plain text file.
%I A204913 #6 Feb 27 2013 09:44:09
%S A204913 1,2,5,9,6,5,4,14,13,14,15,9,8,7,13,27,18,20,21,14,27,65,12,27,41,16,
%T A204913 44,27,83,20,28,44,15,18,35,44,60,38,34,14,26,27,97,65,13,12,11,27,52,
%U A204913 54,18,16,129,44,65,27,21,109,29,35
%N A204913 Least k such that n divides the k-th difference between distinct double factorials.
%C A204913 For a guide to related sequences, see A204892.
%t A204913 (See the program at A204982.)
%Y A204913 Cf. A204982, A204892.
%K A204913 nonn
%O A204913 1,2
%A A204913 _Clark Kimberling_, Jan 22 2012