login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A269728 Let k be a number not a power of 2 (see A057716), and define r by 2^(r-1) < k < 2^r; a(n) is smallest prime of the form 2^r*m+1 such that the exponential sum S(sigma_{m,k}) avoids p. 0

%I #10 Mar 08 2016 10:11:20

%S 5,17,41,73,97,17,17,17,17,17,17,1601,97,97,449,257,97,97,97,97,193,

%T 257,97,97,97,449,193,1409,193,193,193,257,193,449,769,257,193,449,

%U 257,193,193,193,193,257,449,193,193,193,257,449,257,257,257,449,641

%N Let k be a number not a power of 2 (see A057716), and define r by 2^(r-1) < k < 2^r; a(n) is smallest prime of the form 2^r*m+1 such that the exponential sum S(sigma_{m,k}) avoids p.

%C See Castro-Medina (2016) for precise definition.

%C It is only a conjecture that this sequence is infinite.

%H Francis N. Castro and Luis A. Medina, <a href="http://arxiv.org/abs/1603.00534">Modular periodicity of exponential sums of symmetric Boolean functions and some of its consequences</a>, arXiv:1603.00534 [math.NT], 2016.

%Y Cf. A057716.

%K nonn

%O 1,1

%A _N. J. A. Sloane_, Mar 08 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 22:07 EDT 2024. Contains 375518 sequences. (Running on oeis4.)