|
Search: id:A093509
|
|
| |
|
| 0, 5, 6, 10, 12, 15, 18, 20, 24, 25, 30, 35, 36, 40, 42, 45, 48, 50, 54, 55, 60, 65, 66, 70, 72, 75, 78, 80, 84, 85, 90, 95, 96, 100, 102, 105, 108, 110, 114, 115, 120, 125, 126, 130, 132, 135, 138, 140, 144, 145, 150, 155, 156, 160, 162, 165, 168, 170, 174, 175
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Numbers that are congruent to {0, 5, 6, 10, 12, 15, 18, 20, 24, 25} mod 30.
Also without 0: numbers n such that cos(Pi*x/n)+cos(Pi*y/n)=1/2 has integer solutions (x,y).
Numbers n such that there exists a nontrivial configuration to an n-1 x n-1 Lights Out game from the all-off state to the all-off state.
|
|
REFERENCES
|
J. H. Conway and A. D. Jones, Trigonometric diophantine equations (on vanishing sums of roots of unity), Acta Arith. XXX (1976) 229-240.
|
|
LINKS
|
M. Hunziker, A. Machiavelo and J. Park, Chebyshev polynomials over finite fields and reversibility of s-automata...
Eric Weisstein's World of Mathematics, Lights Out Puzzle
|
|
EXAMPLE
|
102 = 6*17, so 102 is in sequence.
|
|
CROSSREFS
|
Adjacent sequences: A093506 A093507 A093508 this_sequence A093510 A093511 A093512
Sequence in context: A037359 A099538 A093614 this_sequence A105953 A102506 A062845
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Ralf Stephan (ralf(AT)ark.in-berlin.de), May 22 2004
|
|
|
Search completed in 0.002 seconds
|
