|
Search: id:A006457
|
|
|
| A006457 |
|
Number of elements in Z[ i ] whose `smallest algorithm' is <= n.
(Formerly M3873)
|
|
+0
3
|
|
| 1, 5, 17, 49, 125, 297, 669, 1457, 3093, 6457, 13309, 27201, 55237, 111689, 225101, 452689, 908885, 1822809, 3652701, 7315553, 14645349, 29311081, 58650733, 117342321, 234741877
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
P. Samuel, About Euclidean rings, J. Alg., 19 (1971), 282-301.
|
|
LINKS
|
S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
|
|
FORMULA
|
a(n+5)-4a(n+4)+3a(n+3)+6a(n+2)-10a(n+1)+4a(n)=0.
|
|
MAPLE
|
A006457:=(1+z+2*z**3)/(2*z-1)/(2*z**2-1)/(z-1)**2; [Conjectured by S. Plouffe in his 1992 dissertation.]
|
|
CROSSREFS
|
Cf. A006458, A006459.
Sequence in context: A003295 A011853 A136303 this_sequence A115981 A083091 A082753
Adjacent sequences: A006454 A006455 A006456 this_sequence A006458 A006459 A006460
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
H. W. Lenstra, Jr.
|
|
|
Search completed in 0.002 seconds
|
