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!)
A325490 Digits of one of the four 5-adic integers 6^(1/4) that is congruent to 2 mod 5. 10

%I #12 Mar 24 2023 02:45:46

%S 2,4,0,3,0,2,0,4,0,3,0,2,2,2,1,2,1,4,0,3,4,2,1,4,1,1,2,0,0,3,0,1,1,3,

%T 1,4,4,0,2,4,0,4,1,2,0,1,2,3,2,4,2,4,1,3,0,2,1,0,3,3,3,3,0,2,2,3,1,1,

%U 4,1,1,0,1,4,0,3,3,3,0,3,0,0,4,0,3,2,3,1

%N Digits of one of the four 5-adic integers 6^(1/4) that is congruent to 2 mod 5.

%C One of the two square roots of A324026, where an A-number represents a 5-adic number. The other square root is A325491.

%C For k not divisible by 5, k is a fourth power in 5-adic field if and only if k == 1 (mod 5). If k is a fourth power in 5-adic field, then k has exactly 4 fourth-power roots.

%H Robert Israel, <a href="/A325490/b325490.txt">Table of n, a(n) for n = 0..10000</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/P-adic_number">p-adic number</a>

%F Equals A325489*A210850 = A325492*A210851.

%F a(n) = (A325485(n+1) - A325485(n))/13^n.

%F For n > 0, a(n) = 4 - A325491(n).

%e The unique number k in [1, 5^3] and congruent to 2 modulo 5 such that k^4 - 6 is divisible by 5^3 is k = 22 = (42)_5, so the first three terms are 2, 4 and 0.

%p S:= select(t -> op([1,3,1],t)=2, [padic:-rootp(_Z^4-6,5,100)]):

%p op([1,1,3],S); # _Robert Israel_, Mar 23 2023

%o (PARI) a(n) = lift(sqrtn(6+O(5^(n+1)), 4) * sqrt(-1+O(5^(n+1))))\5^n

%Y Cf. A210850, A210851, A324026, A325484, A325485, A325486, A325487.

%Y Digits of p-adic fourth-power roots:

%Y A325489, this sequence, A325491, A325492 (5-adic, 6^(1/4));

%Y A324085, A324086, A324087, A324153 (13-adic, 3^(1/4)).

%K nonn,base

%O 0,1

%A _Jianing Song_, Sep 07 2019

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 September 2 18:04 EDT 2024. Contains 375616 sequences. (Running on oeis4.)