|
Search: id:A006459
|
|
|
| A006459 |
|
Number of elements in Z[ sqrt(-2) ] whose `smallest algorithm' is <= n.
(Formerly M2771)
|
|
+0
4
|
|
| 1, 3, 9, 17, 31, 53, 85, 133, 197, 293, 417, 593, 849, 1193, 1661, 2291, 3139, 4299
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
No recurrence is known.
a(n) = upper left and lower right terms of the 2 X 2 matrix [1,-2; 2,1]^n. - Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 28 2008
|
|
REFERENCES
|
P. Samuel, About Euclidean rings, J. Alg., 19 (1971), 282-301.
|
|
CROSSREFS
|
Cf. A006457, A006458.
Sequence in context: A018466 A035107 A090262 this_sequence A049778 A123325 A116688
Adjacent sequences: A006456 A006457 A006458 this_sequence A006460 A006461 A006462
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
H. W. Lenstra, Jr.
|
|
|
Search completed in 0.002 seconds
|
