|
%I #7 Sep 11 2019 20:38:20
%S 1,1,0,0,1,0,1,1,0,0,0,1,1,1,1,1,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,1,0,
%T 0,0,0,1,1,0,1,0,0,1,0,0,0,1,1,1,1,1,0,0,1,0,0,0,0,0,0,0,1,0,1,0,0,0,
%U 1,1,0,1,1,0,1,0,1,1,1,1,0,0,1,0,0,0,1,0
%N Digits of the 2-adic integer 3^(1/5).
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/P-adic_number">p-adic number</a>
%F a(n) = (A325892(n+1) - A325892(n))/2^n.
%F a(n) = 0 if A325892(n)^5 - 3 is divisible by 2^(n+1), otherwise a(n) = 1.
%e Equals ...0110000110000000010000011111100011010011.
%o (PARI) a(n) = lift(sqrtn(3+O(2^(n+1)), 5))\2^n
%Y Cf. A325892.
%Y Digits of p-adic fifth-power roots:
%Y this sequence (2-adic, 3^(1/5));
%Y A325897 (2-adic, 5^(1/5));
%Y A325898 (2-adic, 7^(1/5));
%Y A325899 (2-adic, 9^(1/5));
%Y A322169 (5-adic, 7^(1/5));
%Y A309445 (7-adic, 2^(1/5));
%Y A309446 (7-adic, 3^(1/5));
%Y A309447 (7-adic, 4^(1/5));
%Y A309448 (7-adic, 5^(1/5));
%Y A309449 (7-adic, 6^(1/5)).
%K nonn,base
%O 0
%A _Jianing Song_, Sep 07 2019
|
