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-9 of 9 results.

A324086 Digits of one of the four 3-adic integers 3^(1/4) that is congruent to 3 mod 13.

Original entry on oeis.org

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

Views

Author

Jianing Song, Sep 01 2019

Keywords

Comments

One of the two square roots of A322088, where an A-number represents a 13-adic number. The other square root is A324087.
For k not divisible by 13, k is a fourth power in 13-adic field if and only if k == 1, 3, 9 (mod 13). If k is a fourth power in 13-adic field, then k has exactly 4 fourth-power roots.

Examples

			The unique number k in [1, 13^3] and congruent to 3 modulo 13 such that k^4 - 3 is divisible by 13^3 is k = 575 = (353)_13, so the first three terms are 3, 5 and 3.
		

Crossrefs

Programs

  • PARI
    a(n) = lift(sqrtn(3+O(13^(n+1)), 4))\13^n

Formula

a(n) = (A324082(n+1) - A324082(n))/13^n.
For n > 0, a(n) = 12 - A324087(n).

A324087 Digits of one of the four 3-adic integers 3^(1/4) that is congruent to 10 mod 13.

Original entry on oeis.org

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

Views

Author

Jianing Song, Sep 01 2019

Keywords

Comments

One of the two square roots of A322088, where an A-number represents a 13-adic number. The other square root is A324086.
For k not divisible by 13, k is a fourth power in 13-adic field if and only if k == 1, 3, 9 (mod 13). If k is a fourth power in 13-adic field, then k has exactly 4 fourth-power roots.

Examples

			The unique number k in [1, 13^3] and congruent to 10 modulo 13 such that k^4 - 3 is divisible by 13^3 is k = 1622 = (97A)_13, so the first three terms are 10, 7 and 9.
		

Crossrefs

Programs

  • PARI
    a(n) = lift(-sqrtn(3+O(13^(n+1)), 4))\13^n

Formula

a(n) = (A324083(n+1) - A324083(n))/13^n.
For n > 0, a(n) = 12 - A324086(n).

A322087 Digits of one of the two 13-adic integers sqrt(3).

Original entry on oeis.org

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

Views

Author

Jianing Song, Nov 26 2018

Keywords

Comments

This square root of 3 in the 13-adic field ends with digit 4. The other, A322088, ends with digit 9.

Examples

			...BC1853A30C35378085250559BB6A461A9912C8684.
		

Crossrefs

Cf. A322085.
Digits of p-adic integers:
A321074, A321075 (11-adic, sqrt(3));
this sequence, A322088 (13-adic, sqrt(3));
A286838, A286839 (13-adic, sqrt(-1));
A322091, A322092 (13-adic, sqrt(-3)).

Programs

  • PARI
    a(n) = truncate(sqrt(3+O(13^(n+1))))\13^n

Formula

a(n) = (A322085(n+1) - A322085(n))/13^n.
For n > 0, a(n) = 12 - A322088(n).
This 13-adic integer is the 13-adic limit as n -> oo of the integer sequence {2*T(13^n,2)}, where T(n,x) denotes the n-th Chebyshev polynomial. - Peter Bala, Dec 04 2022

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

Original entry on oeis.org

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

Views

Author

Jianing Song, Aug 26 2019

Keywords

Comments

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

Examples

			The solution to x^2 == -1 (mod 17^4) such that x == 4 (mod 17) is x == 27493 (mod 17^4), and 27493 is written as 5A24 in heptadecimal, so the first four terms are 4, 2, 10 and 5.
		

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));
this sequence, A309990 (17-adic, sqrt(-1)).

Programs

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

Formula

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

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).

A322086 One of the two successive approximations up to 13^n for 13-adic integer sqrt(3). Here the 9 (mod 13) case (except for n = 0).

Original entry on oeis.org

0, 9, 61, 1075, 9863, 9863, 3722793, 56817692, 245063243, 2692255406, 23901254152, 1540344664491, 12293307028713, 198677988008561, 804428201193067, 24428686515388801, 75614579529479558, 741031188712659399, 26692278946856673198, 813880127610558425101, 11047322160238681199840
Offset: 0

Views

Author

Jianing Song, Nov 26 2018

Keywords

Comments

For n > 0, a(n) is the unique solution to x^2 == 3 (mod 13^n) in the range [0, 13^n - 1] and congruent to 9 modulo 13.
A322085 is the approximation (congruent to 4 mod 13) of another square root of 3 over the 13-adic field.

Examples

			9^2 = 81 = 6*13 + 3.
61^2 = 3721 = 22*13^2 + 3.
1075^2 = 1155625 = 526*13^3 + 3.
		

Crossrefs

Programs

  • Maple
    S:= map(t -> op([1,3],t),[padic:-evalp(RootOf(x^2-3,x),13,30)]):
    S9:= op(select(t -> t[1]=9, S)):
    seq(add(S9[i]*13^(i-1),i=1..n-1),n=1..31); # Robert Israel, Jun 13 2019
  • PARI
    a(n) = truncate(-sqrt(3+O(13^n)))

Formula

For n > 0, a(n) = 13^n - A322085(n).
a(n) = Sum_{i=0..n-1} A322088(i)*13^i.
a(n) = A286840(n)*A322090(n) mod 13^n = A286841(n)*A322089(n) mod 13^n.

A322091 Digits of one of the two 13-adic integers sqrt(-3).

Original entry on oeis.org

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

Views

Author

Jianing Song, Nov 26 2018

Keywords

Comments

This square root of -3 in the 13-adic field ends with digit 6. The other, A322092, ends with digit 7.

Examples

			...36225C13B64119495621560453C582989447A6C36.
		

Crossrefs

Programs

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

Formula

a(n) = (A322089(n+1) - A322089(n))/13^n.
For n > 0, a(n) = 12 - A322092(n).
This 13-adic integer is the 13-adic limit as n -> oo of the integer sequence {L(13^n,6)}, where L(n,x) denotes the n-th Lucas polynomial, the n-th row polynomial of A114525. - Peter Bala, Dec 05 2022

A322092 Digits of one of the two 13-adic integers sqrt(-3).

Original entry on oeis.org

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

Views

Author

Jianing Song, Nov 26 2018

Keywords

Comments

This square root of -3 in the 13-adic field ends with digit 7. The other, A322091, ends with digit 6.

Examples

			...96AA70B9168BB38376AB76C879074A34388526097.
		

Crossrefs

Programs

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

Formula

a(n) = (A322090(n+1) - A322090(n))/13^n.
For n > 0, a(n) = 12 - A322091(n).
This 13-adic integer is the 13-adic limit as n -> oo of the integer sequence {L(13^n,7)}, where L(n,x) denotes the n-th Lucas polynomial, the n-th row polynomial of A114525. - Peter Bala, Dec 05 2022

A321074 Digits of one of the two 11-adic integers sqrt(3).

Original entry on oeis.org

5, 2, 6, 8, 1, 9, 9, 4, 3, 9, 2, 8, 3, 4, 9, 1, 9, 3, 3, 0, 5, 5, 0, 9, 8, 4, 1, 9, 6, 9, 3, 0, 7, 5, 8, 6, 3, 9, 0, 9, 7, 7, 9, 8, 10, 5, 8, 6, 9, 3, 5, 9, 4, 7, 2, 1, 1, 0, 1, 0, 8, 1, 6, 5, 7, 10, 8, 2, 4, 7, 8, 7, 2, 3, 3, 1, 10, 6, 0, 10, 0, 6, 2, 5, 1, 10, 3
Offset: 0

Views

Author

Jianing Song, Oct 27 2018

Keywords

Comments

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

Examples

			...9093685703969148905503391943829349918625.
		

Crossrefs

Programs

  • PARI
    a(n) = truncate(sqrt(3+O(11^(n+1))))\11^n
    
  • PARI
    seq(n)={Vecrev(digits(truncate(sqrt(3 + O(11^n))), 11), n)} \\ Andrew Howroyd, Nov 03 2018

Formula

a(n) = (A321072(n+1) - A321072(n))/11^n.
For n > 0, a(n) = 10 - A321075(n).
This 11-adic integer equals the 11-adic limit as n -> oo of 2*T(11^n,5/2), where T(n,x) denotes the n-th Chebyshev polynomial of the first kind. - Peter Bala, Dec 05 2022
Showing 1-9 of 9 results.