|
Search: id:A135510
|
|
|
| A135510 |
|
Least numbers not generated by Eisenstein's algorithm: m=1 n=1, then insert between them m+n, at stage p=1. (E.g. next stage (p=2) of Eisenstein's algorithm would be m, m+m+n, m+n, m+n+n, n). The maximum of these symmetric row elements at stage p is fibonacci(p+2); but how to determine the first number not generated at stage p?. |
|
+0
1
|
|
| 3, 4, 6, 6, 14, 20, 28, 38, 54, 90, 150, 216, 350, 506, 876, 1230, 2034, 3160, 4470, 7764, 12190, 18816, 29952, 43800, 73968, 112602, 182210
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
G. Eisenstein, 1850, 'Ueber ein einfaches Mittel zur Auffindung der hoeheren Reciprocitaetsgesetze und der mit ihnen zu verbindenden Ergaenzungssaetze', Journal fuer die reine und angewandte Mathematik, Volume 39, page 351ff.
M. Stern, 1858, 'Ueber eine zahlentheoretische Funktion', Journal fuer die reine und angewandte Mathematik, Volume 55, page 193ff.
|
|
CROSSREFS
|
Sequence in context: A158523 A001615 A133689 this_sequence A065967 A117986 A070737
Adjacent sequences: A135507 A135508 A135509 this_sequence A135511 A135512 A135513
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
mc (da-da(AT)lycos.de), Feb 09 2008
|
|
|
Search completed in 0.002 seconds
|
