|
Search: id:A016726
|
|
|
| A016726 |
|
Smallest k such that 1, 4, 9, ..., n^2 are distinct mod k. |
|
+0
1
|
|
| 1, 2, 6, 9, 10, 13, 14, 17, 19, 22, 22, 26, 26, 29, 31, 34, 34, 37, 38, 41, 43, 46, 46, 53, 53, 53, 58, 58, 58, 61, 62, 67, 67, 71, 71, 73, 74, 79, 79, 82, 82, 86, 86, 89, 94, 94, 94, 97, 101, 101, 103, 106, 106, 109, 113, 113, 118, 118, 118, 122, 122, 127, 127, 131, 131, 134
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
Arnold, L. K.; Benkoski, S. J.; and McCabe, B. J.; The discriminator (a simple application of Bertrand's postulate). Amer. Math. Monthly 92 (1985), 275-277.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
|
|
FORMULA
|
For n > 4, a(n) is smallest k >= 2n such that k = p or k = 2p, p a prime.
|
|
CROSSREFS
|
Sequence in context: A175030 A121248 A108370 this_sequence A047396 A085304 A015843
Adjacent sequences: A016723 A016724 A016725 this_sequence A016727 A016728 A016729
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
bernie(AT)wagnerpa.com (Bernie McCabe)
|
|
|
Search completed in 0.002 seconds
|
