login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061344 Numbers of form p^m + 1, p odd prime, m >= 1. 2

%I

%S 4,6,8,10,12,14,18,20,24,26,28,30,32,38,42,44,48,50,54,60,62,68,72,74,

%T 80,82,84,90,98,102,104,108,110,114,122,126,128,132,138,140,150,152,

%U 158,164,168,170,174,180,182,192,194,198,200,212,224,228,230,234,240

%N Numbers of form p^m + 1, p odd prime, m >= 1.

%C Lengths of almost-binary sequences with perfect odd-periodic autocorrelation function.

%C As J. Arndt points out, each element of this sequence leads to a conference matrix (cf. link to Wikipedia and A000952). - _M. F. Hasler_, Mar 14 2008

%D H. D. Lueke, Binary odd-periodic complementary sequences. IEEE Trans. Inform. Theory, 43, pp. 365-367, 1997.

%H M. F. Hasler, <a href="/A061344/b061344.txt">Table of n, a(n) for n = 1..10000</a>

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Conference_matrix">Conference matrix</a>.

%o (PARI) A061344(n)= local(m=1,p); for(c=1,n, until( isprime(m+=2) || ispower(m,[null], && p) && isprime(p),); /*print(c," ",m+1)*/); m+1 \\ - M. F. Hasler, Mar 14 2008

%Y Equals A061345 + 1. Cf. A000952.

%K nonn,easy

%O 1,1

%A Hans Dieter Lueke (lueke(AT)ient.rwth-aachen.de), Jun 08 2001

%E More terms from Larry Reeves (larryr(AT)acm.org), Jun 12 2001

%E Edited by _M. F. Hasler_, Mar 14 2008

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 17 03:42 EDT 2021. Contains 347478 sequences. (Running on oeis4.)