The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006459 Number of elements in Z[ sqrt(-2) ] whose 'smallest algorithm' is <= n.
(Formerly M2771)
3

%I M2771 #19 Jan 27 2022 23:41:36

%S 1,3,9,17,31,53,85,133,197,293,417,593,849,1193,1661,2291,3139,4299

%N Number of elements in Z[ sqrt(-2) ] whose 'smallest algorithm' is <= n.

%C No recurrence is known.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H H. W. Lenstra, Jr., <a href="/A006457/a006457.pdf">Letter to N. J. A. Sloane, Nov. 1975</a>

%H P. Samuel, <a href="http://dx.doi.org/10.1016/0021-8693(71)90110-4">About Euclidean rings</a>, J. Alg., 19 (1971), 282-301.

%Y Cf. A006457, A006458.

%K nonn,more

%O 0,2

%A H. W. Lenstra, Jr.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 14 05:12 EDT 2024. Contains 372528 sequences. (Running on oeis4.)