|
Search: id:A061344
|
|
|
| A061344 |
|
Numbers of form p^m + 1, p odd prime, m >= 1. |
|
+0
2
|
|
| 4, 6, 8, 10, 12, 14, 18, 20, 24, 26, 28, 30, 32, 38, 42, 44, 48, 50, 54, 60, 62, 68, 72, 74, 80, 82, 84, 90, 98, 102, 104, 108, 110, 114, 122, 126, 128, 132, 138, 140, 150, 152, 158, 164, 168, 170, 174, 180, 182, 192, 194, 198, 200, 212, 224, 228, 230, 234, 240
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Lengths of almost-binary sequences with perfect odd-periodic autocorrelation function.
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
|
|
REFERENCES
|
H. D. Lueke, Binary odd-periodic complementary sequences. IEEE Trans. Inform. Theory, 43, pp. 365-367, 1997.
|
|
LINKS
|
M. F. Hasler, Table of n, a(n) for n=1,...,10 000.
Wikipedia, Conference matrix.
|
|
PROGRAM
|
(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
|
|
CROSSREFS
|
Equals A061345 + 1. Cf. A000952.
Adjacent sequences: A061341 A061342 A061343 this_sequence A061345 A061346 A061347
Sequence in context: A111305 A134928 A141109 this_sequence A066664 A064938 A050990
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Hans Dieter Lueke (lueke(AT)ient.rwth-aachen.de), Jun 08 2001
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Jun 12 2001
Edited by M. F. Hasler (MHasler(AT)univ-ag.fr), Mar 14 2008
|
|
|
Search completed in 0.002 seconds
|
