cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A320103 Let f(1) = 1 + i (where i denotes the imaginary unit) and for n > 0, f(n+1) is the Gaussian prime in the first quadrant (with positive real part and nonnegative imaginary part) with least modulus that divides 1 + Product_{k=1..n} f(k) (in case of a tie minimize the imaginary part); a(n) is the real part of f(n).

Original entry on oeis.org

1, 2, 2, 3, 27, 2, 1, 19953, 1, 3, 4, 5, 1, 100543, 4, 5, 1375, 6, 67, 100129349439, 35, 22, 7200537, 11, 90, 733, 1653333714972695690441280142887575811965481459539542336
Offset: 1

Views

Author

Rémy Sigrist, Oct 06 2018

Keywords

Comments

See A319920 for the square of the modulus of f and additional comments.

Crossrefs

Cf. A319920.

A320104 Let f(1) = 1 + i (where i denotes the imaginary unit) and for n > 0, f(n+1) is the Gaussian prime in the first quadrant (with positive real part and nonnegative imaginary part) with least modulus that divides 1 + Product_{k=1..n} f(k) (in case of a tie minimize the imaginary part); a(n) is the imaginary part of f(n).

Original entry on oeis.org

1, 1, 3, 0, 20, 5, 4, 15910, 2, 2, 1, 2, 6, 81598, 5, 366, 588, 5, 202, 111603136724, 104, 13, 246202, 0, 61, 492, 439943534049216658488928456219783705840806353246605875
Offset: 1

Views

Author

Rémy Sigrist, Oct 06 2018

Keywords

Comments

See A319920 for the square of the modulus of f and additional comments.

Crossrefs

Cf. A319920.
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.