|
Search: id:A005524
|
|
|
| A005524 |
|
k-arcs on elliptic curves over GF(q).
(Formerly M0475)
|
|
+0
1
|
|
| 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 16, 18, 19, 20, 21, 22, 25, 27, 28, 30, 32, 34, 37, 38, 40, 42, 44, 45, 48, 50, 51, 54, 58, 61, 62, 64, 65, 67, 72, 74, 75, 75
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
COMMENT
|
The number 235 is the first counterexample to Benoit Cloitre's conjecture: 235 = ((1+1)*(1+1)+1)*((1+1)*((1+1)*((1+1)*((1+1)*(1+1)+1)+1)+1)+1) - using 5*47 - needs 19 1's 235 = (1+1)*(1+1+1)*(1+1+1)*((1+1+1)*(1+1)*(1+1)+1) - using 2*3*3*13+1 - only needs 17 1's. - Ed Pegg Jr (ed(AT)mathpuzzle.com), Apr 14 2004
|
|
REFERENCES
|
J. W. P. Hirschfeld, Linear codes and algebraic codes, pp. 35-53 of F. C. Holroyd and R. J. Wilson, editors, Geometrical Combinatorics. Pitman, Boston, 1984.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
E T Pegg, Integer Complexity.
Mathematica Information Center, Item 5175, for full code.
|
|
CROSSREFS
|
Sequence in context: A094270 A125705 A154314 this_sequence A082918 A033110 A049812
Adjacent sequences: A005521 A005522 A005523 this_sequence A005525 A005526 A005527
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
