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.

Previous Showing 11-15 of 15 results.

A309990 Digits of one of the two 17-adic integers sqrt(-1).

Original entry on oeis.org

13, 14, 6, 11, 4, 0, 4, 8, 3, 13, 2, 16, 10, 15, 16, 1, 15, 8, 2, 11, 9, 0, 2, 15, 11, 3, 7, 10, 11, 4, 0, 1, 7, 0, 2, 4, 0, 15, 13, 10, 12, 6, 1, 11, 0, 4, 14, 15, 11, 12, 16, 1, 14, 5, 2, 7, 11, 15, 5, 0, 1, 9, 11, 10, 2, 13, 4, 16, 16, 5, 4, 3, 7, 11, 12, 0
Offset: 0

Views

Author

Jianing Song, Aug 26 2019

Keywords

Comments

This square root of -1 in the 17-adic field ends with digit 13 (D when written as a 17-adic number). The other, A309989, ends with digit 4.

Examples

			The solution to x^2 == -1 (mod 17^4) such that x == 13 (mod 17) is x == 56028 (mod 17^4), and 56028 is written as B6ED in heptadecimal, so the first four terms are 13, 14, 6 and 11.
		

Crossrefs

Digits of p-adic square roots:
A318962, A318963 (2-adic, sqrt(-7));
A271223, A271224 (3-adic, sqrt(-2));
A269591, A269592 (5-adic, sqrt(-4));
A210850, A210851 (5-adic, sqrt(-1));
A290794, A290795 (7-adic, sqrt(-6));
A290798, A290799 (7-adic, sqrt(-5));
A290796, A290797 (7-adic, sqrt(-3));
A051277, A290558 (7-adic, sqrt(2));
A321074, A321075 (11-adic, sqrt(3));
A321078, A321079 (11-adic, sqrt(5));
A322091, A322092 (13-adic, sqrt(-3));
A286838, A286839 (13-adic, sqrt(-1));
A322087, A322088 (13-adic, sqrt(3));
A309989, this sequence (17-adic, sqrt(-1)).

Programs

  • PARI
    a(n) = truncate(-sqrt(-1+O(17^(n+1))))\17^n

Formula

a(n) = (A286878(n+1) - A286878(n))/17^n.
For n > 0, a(n) = 16 - A309989(n).

A324029 Digits of one of the two 5-adic integers sqrt(-6) that is related to A324027.

Original entry on oeis.org

2, 2, 1, 1, 2, 3, 2, 4, 3, 1, 0, 0, 1, 3, 1, 3, 4, 2, 3, 2, 3, 2, 4, 4, 2, 3, 3, 0, 1, 1, 3, 1, 1, 1, 3, 1, 2, 3, 2, 3, 4, 1, 0, 2, 4, 4, 3, 4, 0, 3, 2, 0, 2, 0, 2, 0, 3, 2, 0, 0, 4, 2, 4, 4, 0, 4, 4, 4, 3, 1, 4, 2, 2, 4, 2, 0, 0, 0, 3, 0, 4, 3, 2, 4, 3, 3, 4, 0
Offset: 0

Views

Author

Jianing Song, Sep 07 2019

Keywords

Comments

This square root of -6 in the 5-adic field ends with digit 2. The other, A324030, ends with digit 3.

Examples

			The solution to x^2 == -6 (mod 5^4) such that x == 2 (mod 5) is x == 162 (mod 5^4), and 162 is written as 1122 in quinary, so the first four terms are 2, 2, 1 and 1.
		

Crossrefs

Digits of 5-adic square roots:
this sequence, A324030 (sqrt(-6));
A269591, A269592 (sqrt(-4));
A210850, A210851 (sqrt(-1));
A324025, A324026 (sqrt(6)).

Programs

  • PARI
    a(n) = truncate(sqrt(-6+O(5^(n+1))))\5^n

Formula

a(n) = (A324027(n+1) - A324027(n))/5^n.
For n > 0, a(n) = 4 - A324030(n).
Equals A210850*A324026 = A210851*A324025, where each A-number represents a 5-adic number.

A324030 Digits of one of the two 5-adic integers sqrt(-6) that is related to A324028.

Original entry on oeis.org

3, 2, 3, 3, 2, 1, 2, 0, 1, 3, 4, 4, 3, 1, 3, 1, 0, 2, 1, 2, 1, 2, 0, 0, 2, 1, 1, 4, 3, 3, 1, 3, 3, 3, 1, 3, 2, 1, 2, 1, 0, 3, 4, 2, 0, 0, 1, 0, 4, 1, 2, 4, 2, 4, 2, 4, 1, 2, 4, 4, 0, 2, 0, 0, 4, 0, 0, 0, 1, 3, 0, 2, 2, 0, 2, 4, 4, 4, 1, 4, 0, 1, 2, 0, 1, 1, 0, 4
Offset: 0

Views

Author

Jianing Song, Sep 07 2019

Keywords

Comments

This square root of -6 in the 5-adic field ends with digit 3. The other, A324029, ends with digit 2.

Examples

			The solution to x^2 == -6 (mod 5^4) such that x == 3 (mod 5) is x == 463 (mod 5^4), and 463 is written as 3323 in quinary, so the first four terms are 3, 2, 3 and 3.
		

Crossrefs

Digits of 5-adic square roots:
A324029, sequence (sqrt(-6));
A269591, A269592 (sqrt(-4));
A210850, A210851 (sqrt(-1));
A324025, A324026 (sqrt(6)).

Programs

  • PARI
    a(n) = truncate(-sqrt(-6+O(5^(n+1))))\5^n

Formula

a(n) = (A324028(n+1) - A324028(n))/5^n.
For n > 0, a(n) = 4 - A324029(n).
Equals A210850*A324025 = A210851*A324026, where each A-number represents a 5-adic number.

A327305 Digits of one of the two 5-adic integers sqrt(-9) that is related to A327303.

Original entry on oeis.org

4, 0, 3, 0, 0, 1, 1, 4, 2, 0, 2, 2, 3, 2, 4, 4, 1, 1, 2, 2, 3, 0, 2, 2, 4, 2, 1, 4, 1, 4, 0, 0, 0, 2, 4, 1, 1, 3, 1, 1, 0, 4, 1, 2, 1, 2, 2, 1, 1, 2, 0, 0, 3, 1, 2, 0, 4, 2, 0, 3, 4, 4, 0, 0, 0, 0, 1, 4, 0, 3, 4, 0, 1, 4, 4, 3, 3, 0, 2, 3, 2, 3, 3, 3, 1, 4, 2, 4
Offset: 0

Views

Author

Jianing Song, Sep 16 2019

Keywords

Comments

This is the 5-adic solution to x^2 = -9 that ends in 4. A327304 gives the other solution that ends in 1.

Examples

			Equals ...1131142000414124220322114423220241100304.
		

Crossrefs

Digits of 5-adic square roots:
A327304, this sequence (sqrt(-9));
A324029, A324030 (sqrt(-6));
A269591, A269592 (sqrt(-4));
A210850, A210851 (sqrt(-1));
A324025, A324026 (sqrt(6)).

Programs

  • Maple
    op([1,1,3], select(t -> padic:-ratvaluep(t,1)=4, [padic:-rootp(x^2+9,5,100)])); # Robert Israel, Aug 31 2020
  • PARI
    a(n) = truncate(-sqrt(-9+O(5^(n+1))))\5^n

Formula

For n > 0, a(n) is the unique m in {0, 1, 2, 3, 4} such that (A327303(n) + m*5^n)^2 + 9 is divisible by 5^(n+1).
a(n) = (A327303(n+1) - A327303(n))/5^n.
For n > 0, a(n) = 4 - A327304(n).

A327304 Digits of one of the two 5-adic integers sqrt(-9) that is related to A327302.

Original entry on oeis.org

1, 4, 1, 4, 4, 3, 3, 0, 2, 4, 2, 2, 1, 2, 0, 0, 3, 3, 2, 2, 1, 4, 2, 2, 0, 2, 3, 0, 3, 0, 4, 4, 4, 2, 0, 3, 3, 1, 3, 3, 4, 0, 3, 2, 3, 2, 2, 3, 3, 2, 4, 4, 1, 3, 2, 4, 0, 2, 4, 1, 0, 0, 4, 4, 4, 4, 3, 0, 4, 1, 0, 4, 3, 0, 0, 1, 1, 4, 2, 1, 2, 1, 1, 1, 3, 0, 2, 0
Offset: 0

Views

Author

Jianing Song, Sep 16 2019

Keywords

Comments

This is the 5-adic solution to x^2 = -9 that ends in 1. A327305 gives the other solution that ends in 4.

Examples

			Equals ...3313302444030320224122330021224203344141.
		

Crossrefs

Digits of 5-adic square roots:
this sequence, A327305 (sqrt(-9));
A324029, A324030 (sqrt(-6));
A269591, A269592 (sqrt(-4));
A210850, A210851 (sqrt(-1));
A324025, A324026 (sqrt(6)).

Programs

  • PARI
    a(n) = truncate(-sqrt(-9+O(5^(n+1))))\5^n

Formula

For n > 0, a(n) is the unique m in {0, 1, 2, 3, 4} such that (A327302(n) + m*5^n)^2 + 9 is divisible by 5^(n+1).
a(n) = (A327302(n+1) - A327302(n))/5^n.
For n > 0, a(n) = 4 - A327305(n).
Previous Showing 11-15 of 15 results.