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.

A270097 Discriminator sequence for the powers of 2: smallest positive integer d such that 2^0, 2^1, ..., 2^{n-1} are all incongruent modulo d.

This page as a plain text file.
%I A270097 #6 Mar 12 2016 21:56:31
%S A270097 1,2,4,5,9,9,11,11,11,11,13,13,19,19,19,19,19,19,25,25,29,29,29,29,29,
%T A270097 29,29,29,37,37,37,37,37,37,37,37,53,53,53,53,53,53,53,53,53,53,53,53,
%U A270097 53,53,53,53,59,59,59,59,59,59,61,61,67,67,67,67,67,67,83,83,83,83,83,83,83,83,83,83,83,83,83,83,83,83,101
%N A270097 Discriminator sequence for the powers of 2:  smallest positive integer d such that 2^0, 2^1, ..., 2^{n-1} are all incongruent modulo d.
%C A270097 The discriminator of a finite sequence s is the smallest positive integer d such that all the elements of s are incongruent modulo d.  The sequence in question is the discriminator of the first n powers of 2.
%H A270097 Zhi-Wei Sun, <a href="http://dx.doi.org/10.1016/j.jnt.2013.02.003">On functions taking only prime values</a>, J. Number Theory 133(2013), no.8, 2794-2812.
%K A270097 nonn
%O A270097 0,2
%A A270097 _Jeffrey Shallit_, Mar 11 2016