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.

A205124 Least s(k) such that n divides s(k)-s(j) for some j where s(j)= j*(2^(j-1)).

This page as a plain text file.
%I A205124 #5 Mar 30 2012 18:58:10
%S A205124 4,12,4,12,32,80,32,12,192,32,12,80,448,32,192,80,80,192,80,32,5120,
%T A205124 1024,448,80,2304,448,11264,32,2304,192,32,192,1024,80,5120,192,448,
%U A205124 80,11264,192,53248,5120,524288,1024,192,448,192,80,2304,2304
%N A205124 Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)= j*(2^(j-1)).
%C A205124 For a guide to related sequences, see A204892.
%t A205124 (See the program at A205122.)
%Y A205124 Cf. A205122, A204892.
%K A205124 nonn
%O A205124 1,1
%A A205124 _Clark Kimberling_, Jan 25 2012