|
Search: id:A106275
|
|
|
| A106275 |
|
Numbers n for which the absolute value of the discriminant of the polynomial x^n - x^(n-1) -...- x - 1 is a prime times 2^k for some k >=0. |
|
+0
2
|
|
| 2, 3, 4, 5, 6, 7, 21, 26, 99, 158, 405
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
This polynomial is the characteristic polynomial of the Fibonacci and Lucas n-step recursions. Are the n-step recursions different -- in some way -- for the values of n that yield a prime*2^k discriminant? No other n < 10000.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Fibonacci n-Step
|
|
CROSSREFS
|
Cf. A106273 (discriminant of the polynomial x^n-x^(n-1)-...-x-1).
Sequence in context: A024644 A010354 A070759 this_sequence A031054 A153687 A142594
Adjacent sequences: A106272 A106273 A106274 this_sequence A106276 A106277 A106278
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
T. D. Noe (noe(AT)sspectra.com), May 02 2005
|
|
|
Search completed in 0.005 seconds
|
